Abstract
We investigate the scheduling problem for failure-prone transfer lines. By focusing on threshold policies, we seek threshold values that minimize a combined inventory/backlog cost function. The approach is to decompose the transfer line into several one-machine subsystems, each of which models upstream starvation and downstream demand, and iteratively compute threshold based on these models. Simulation studies show that the procedure can converge to near optimal threshold values.