A solution for cyclic scheduling of multi-hoists without overlapping

作者：Zhou Zhili; Li Ling

来源：Annals of Operations Research, 2009, 168(1): 5-21.

DOI：10.1007/s10479-008-0372-8

• Two hoist scheduling problem
• Cyclic scheduling
• Mixed Integer Linear Programming
• Overlapping
• Electroplating lines
• Bottleneck

In this paper, we study the cyclic scheduling problem for electroplating lines where products are loaded into the system at one end and unloaded at the other end. The electroplating jobs must be processed within a given time window in each tank. There is no buffer between tanks. Two hoists sharing a common track are used to move products between the tanks in the production line. The objective is to minimize the production cycle time through scheduling hoist moves. A solution procedure is proposed in this study. The production line is first divided into two non-overlapping zones with a hoist assigned to each zone. Then a mixed integer linear programming model is developed for scheduling hoist moves. Computational results on a benchmark example problem are given in the paper to demonstrate the application of the proposed method.

• 出版日期2009-4
• 单位西安交通大学