A mixed integer linear programming solution for single hoist multi-degree cyclic scheduling with reentrance

This article considers single hoist multi-degree cyclic scheduling problems with reentrance. Time window constraints are also considered. Firstly, a mixed integer programming model is formulated for multi-degree cyclic hoist scheduling without reentrance, referred to as basic lines in this article. Two valid inequalities corresponding to this problem are also presented. Based on the model for basic lines, an extended mixed integer programming model is proposed for more complicated scheduling problems with reentrance. Phillips and Unger's benchmark instance and randomly generated instances are applied to test the model without reentrance, solved using the commercial software CPLEX. The efficiency of the model is analysed based on computational time. Moreover, an example is given to demonstrate the effectiveness of the model with reentrance.

[1]  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..

[2]  Vladimir Kats,et al.  A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling , 1997, Oper. Res. Lett..

[3]  Ling Li,et al.  Single hoist cyclic scheduling with multiple tanks: a material handling solution , 2003, Comput. Oper. Res..

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

[5]  Yun Jiang,et al.  Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution , 2002 .

[6]  MengChu Zhou,et al.  Petri Net-Based Scheduling of Single-Arm Cluster Tools With Reentrant Atomic Layer Deposition Processes , 2011, IEEE Transactions on Automation Science and Engineering.

[7]  Peter Brucker,et al.  A general model for cyclic machine scheduling problems , 2008, Discret. Appl. Math..

[8]  Chihyun Jung,et al.  An Efficient Mixed Integer Programming Model Based on Timed Petri Nets for Diverse Complex Cluster Tool Scheduling Problems , 2012, IEEE Transactions on Semiconductor Manufacturing.

[9]  H. Neil Geismar,et al.  Throughput optimization in dual-gripper interval robotic cells , 2009 .

[10]  Kien Ming Ng,et al.  A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems , 2013 .

[11]  Eugene Levner,et al.  Multiple-part cyclic hoist scheduling using a sieve method , 1999, IEEE Trans. Robotics Autom..

[12]  W. Ng.  A branch and bound algorithm for hoist scheduling of a circuit board production line , 1996 .

[13]  Edmund K. Burke,et al.  A mixed integer programming model for the cyclic job-shop problem with transportation , 2012, Discret. Appl. Math..

[14]  Eugene Levner,et al.  A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times , 2011, Eur. J. Oper. Res..

[15]  Chengbin Chu,et al.  Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots , 2009, Eur. J. Oper. Res..

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

[17]  Bertrand M. T. Lin,et al.  A branch-and-bound algorithm for makespan minimization in differentiation flow shops , 2013 .

[18]  George Steiner,et al.  Scheduling in Reentrant Robotic Cells: Algorithms and Complexity , 2005, J. Sched..

[19]  Danyu Bai,et al.  New approximation algorithms for flow shop total completion time problem , 2013 .

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

[21]  H. Neil Geismar,et al.  Throughput Optimization in Robotic Cells , 2007 .

[22]  Martin Middendorf,et al.  On scheduling cycle shops: classification, complexity and approximation , 2002 .

[23]  Eugene Levner,et al.  A Parametric Critical Path Problem and an Application for Cyclic Scheduling , 1998, Discret. Appl. Math..

[24]  Michel Gourgand,et al.  A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell , 2011, Comput. Oper. Res..

[25]  Lin Danping,et al.  A review of the research methodology for the re-entrant scheduling problem , 2011 .

[26]  Zhen Zhou,et al.  Multi-degree cyclic hoist scheduling with time window constraints , 2011 .

[28]  Zhen Zhou,et al.  A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints , 2012 .

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

[30]  Eugene Levner,et al.  Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints , 2008, Eur. J. Oper. Res..

[31]  Tae-Eog Lee,et al.  Scheduling single-armed cluster tools with reentrant wafer flows , 2006, IEEE Transactions on Semiconductor Manufacturing.

[32]  Lei Lei,et al.  Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints , 2001 .

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

[34]  Chengbin Chu,et al.  Cyclic hoist scheduling in large real-life electroplating lines , 2007, OR Spectr..

[35]  Pengyu Yan,et al.  A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows , 2010 .

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

[37]  Feng Chu,et al.  Multicyclic hoist scheduling with constant processing times , 2002, IEEE Trans. Robotics Autom..

[38]  Jen-Shiang Chen,et al.  Integer programming models for the re-entrant shop scheduling problems , 2006 .

[39]  George Steiner,et al.  On the connection between a cyclic job shop and a reentrant flow shop scheduling problem , 2006, J. Sched..