Hoist Scheduling Problem: State-of-the-Art

Abstract In automated plating processes, hoists ensure the transfer of products between workstations. Scheduling their movements is known as the Hoist Scheduling Problem (HSP). It belongs to the class of strongly NP-hard problems (Lei and Wang, 1989b). Many studies, dealing with different complexity levels of the problem have been published, and the following classification should give the reader quite a large overview of them.

[1]  Henry L. W. Nuttle,et al.  Hoist Scheduling For A PCB Electroplating Facility , 1988 .

[2]  Kin Keung Lai,et al.  A study of heuristics for bidirectional multi-hoist production scheduling systems , 1994 .

[3]  Zelda B. Zabinsky,et al.  An algorithm for scheduling a chemical processing tank line , 1993 .

[4]  Arne Thesen,et al.  An expert scheduling system for material handling hoists , 1990 .

[5]  L. W. Phillips,et al.  Mathematical Programming Solution of a Hoist Scheduling Program , 1976 .

[6]  Yuehwern Yih,et al.  An algorithm for hoist scheduling problems , 1994 .

[7]  Claire Hanen,et al.  Study of a NP-hard cyclic scheduling problem: The recurrent job-shop , 1994 .

[8]  Zelda B. Zabinsky,et al.  An example for scheduling a chemical processing tank line , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[9]  Lei Lei,et al.  A greedy algorithm to determine the number of transporters in a cyclic electroplating process , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[10]  Jacques Lamothe,et al.  A dynamic heuristic for the real time hoist scheduling problem , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[11]  Eugene Levner,et al.  An improved algorithm for a cyclic robotic scheduling problem , 1998 .

[12]  Ronald D. Armstrong,et al.  A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints , 1994 .

[13]  Lei Lei,et al.  The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints , 1991 .

[14]  Y. Ge,et al.  Crane scheduling with time windows in circuit board production lines , 1995 .

[15]  Yuehwern Yih,et al.  Crane scheduling in a flexible electroplating line: a tolerance-based approach , 1992 .

[16]  Pierre Baptiste,et al.  Improving the productivity of electroplating lines by changing the layout of the tanks , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[17]  O. Grunder,et al.  The relationship between the physical layout of the work stations and the productivity of a saturated single-hoist production line , 1997 .

[18]  Qi Su,et al.  Optimal sequencing of double-gripper gantry robot moves in tightly-coupled serial production systems , 1996, IEEE Trans. Robotics Autom..

[19]  Yves Rochat,et al.  A Genetic Approach for Solving a Scheduling Problem in a Robotized Analytical System , 1998, J. Heuristics.

[20]  Chengbin Chu,et al.  Cyclic hoist scheduling based on graph theory , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[21]  L. Lei,et al.  DETERMINING OPTIMAL CYCLIC HOIST SCHEDULES IN A SINGLE-HOIST ELECTROPLATING LINE , 1994 .

[22]  Lei Lei,et al.  Minimizing the fleet size with dependent time-window and single-track constraints , 1993, Oper. Res. Lett..