Scheduling of a single crane in batch annealing process
Computers and Operations Research
Computers and Industrial Engineering
Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey
Computers and Industrial Engineering
A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
Computers and Operations Research
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A hybrid algorithm for the cyclic hoist scheduling problem with two transportation resources
Computers and Industrial Engineering
Hi-index | 0.00 |
Hoist scheduling is a typical problem in the operation of electroplating systems. The cyclic scheduling policy is widely used in these systems in industry. Research on hoist scheduling has focused on the cyclic problem to minimize the cycle length. Most previous studies consider the single-hoist case. In practice, however, more than one hoist is often used in an electroplating line. This paper addresses the two-hoist, no-wait cyclic scheduling problem, in which the tank-processing times are constants and, upon completion of processing in a tank, the parts have to be moved to the next tank immediately. Based on the analysis of the problem properties, a polynomial algorithm is developed to obtain an optimal schedule. This algorithm first identifies a set of thresholds, which are special values of the cycle length, so that the feasibility property may change only at these thresholds. Feasibility checking is then carried out on each individual threshold in ascending order. The first feasible threshold found will be the optimal cycle length, and the corresponding feasible schedule is an optimal hoist schedule.