A Solution for Cyclic Scheduling of Three Hoists without Overlapping
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 processing time at each workstation must be within a given range. There is no buffer between these stations. Three hoists sharing a common track are used to move products between the workstations in the line. The objective is to schedule the moves to minimize the production cycle. To solve the problem, we propose a method, which first divides the line into three non-overlapping zones and assigns a hoist for each zone and than a mixed integer linear programming model is developed for given hoist assignment. The optimal solution can be obtained by solving the model at different hoist assignment and selecting the best one of these solutions. Computational results on a benchmark example problem and a real life example are given in the paper to demonstrate the application of the proposed method.
Hoist Scheduling Problem Mixed Integer Linear Programming overlapping
Zhili ZHOU Jiyin LIU
Department of Industrial Engineering Xian Jiaotong University,Xian,China Business School,Loughborough University Leicestershire LE11 3TU,UK
国际会议
北京
英文
2007-05-30（万方平台首次上网日期，不代表论文的发表时间）