Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Single hoist cyclic scheduling with multiple tanks: a material handling solution
Computers and Operations Research - Special issue: Emerging economics
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
Computers and Industrial Engineering
A contract net based intelligent agent system for solving the reactive hoist scheduling problem
Expert Systems with Applications: An International Journal
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
Operations Research Letters
| Hi-index | 0.00 |
The cyclic hoist scheduling problem is encountered in electroplating facilities, when mass production is required. This class of problems is a branch stemming from the Hoist Scheduling Problem (HSP) where automatic hoist is used for moving electroplates through chemical baths. A repetitive sequence of moves is searched for the hoist in cyclic schedule. To minimize the cycle time of r different part-jobs, we propose a linear optimization approach. An illustrative example is given in order to show some feedback of our exact solving method. Afterward, two comparisons are presented: firstly, between a two 1-cycle homogenous schedule and a 2-cycle heterogeneous part-job and secondly, between 2-cycle and 4-cycle heterogeneous part-job. These comparisons show how, by considering r-cyclic scheduling, we can optimize the cycle length considerably and then the throughput rate of the electroplating line.