Stochastic Cyclic Scheduling Problem in Synchronous Assembly and Production Lines
研究了同步装配与生产线中随机加工时间下的循环调度问题，以最小化周期时间或最大化产出率为目标，提出了两站情况的下界和近似解法，以及一般情况下的启发式算法，并分析了调度决策在不同加工时间变异性下的影响。
In this paper we address the stochastic cyclic scheduling problem in synchronous assembly and production lines.Synchronous lines are widely used in the production and assembly of various goods such as automobiles and household appliances.We consider cycle time minimization (or throughput rate maximization) as the objective of the scheduling problem with the assumption that the processing times are independent random variables.We ¯rst discuss the two-station case and present a lower bounding scheme and an approximate solution procedure for the scheduling problem.For the general case of the problem, two heuristic solution procedures are presented.An extension of the two-station lower bound to the general case of the problem is also discussed.The performance of the proposed heuristics on randomly generated problems is documented, and the impact of scheduling decisions in problems with di®erent levels of variability in processing times is analyzed.We also analyze the problem of sequence determination when the available information is limited to the expected values of individual processing times.