Optimal Scheduling of Material Handling Devices in a PCB Production Line: Problem Formulation and a Polynomial Algorithm

Modern automated production lines usually use one or multiple computer-controlled robots or hoists for material handling between workstations. A typical application of such lines is an automated electroplating line for processing printed circuit boards (PCBs). In these systems, cyclic production policy is widely used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a multihoist electroplating line with constant processing times. The objective is to minimize the cycle time, or equivalently to maximize the production throughput, for a given number of hoists. We propose a mathematical model and a polynomial algorithm for this scheduling problem. Computational results on randomly generated instances are reported.

[1]  Pierre Baptiste,et al.  Resolution Of The Cyclic Multi-Hoists Scheduling Problem With Overlapping Partitions , 1997 .

[2]  Chengbin Chu,et al.  A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line , 2005, Oper. Res. Lett..

[3]  Ronald D. Armstrong,et al.  A greedy algorithm to determine the number of transporters in a cyclic electroplating process , 1996 .

[4]  Guoqing Zhang,et al.  Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence , 2003, IEEE Trans. Robotics Autom..

[5]  Eugene Levner,et al.  Minimizing the number of robots to meet a given cyclic schedule , 1997, Ann. Oper. Res..

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

[7]  Chelliah Sriskandarajah,et al.  Minimizing Makespan in Flowshops with Pallet Requirements: Computational Complexity , 1997 .

[8]  Alessandro Agnetis,et al.  Scheduling no-wait robotic cells with two and three machines , 2000, Eur. J. Oper. Res..

[9]  Xiaoguang Yang,et al.  Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach , 2004, Oper. Res..

[10]  Vadim E. Levit,et al.  An improved algorithm for cyclic flowshop scheduling in a robotic cell , 1997 .

[11]  H. Neil Geismar,et al.  Sequencing and Scheduling in Robotic Cells: Recent Developments , 2005, J. Sched..

[12]  A. Che,et al.  Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach , 2004 .

[13]  Yun Jiang,et al.  An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem , 2005, Oper. Res..

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

[15]  Eugene Levner,et al.  Cyclic scheduling in a robotic production line , 2002 .

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

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

[18]  Chengbin Chu,et al.  Cyclic scheduling of a hoist with time window constraints , 1998, IEEE Trans. Robotics Autom..