A combined robot selection and scheduling problem for flow-shops with no-wait restrictions

This paper addresses a bicriteria no-wait flow-shop scheduling problem with multiple robots transferring jobs between pairs of consecutive machines. The robots share an identical track positioned alongside the machine transfer line. Each robot is assigned to a portion of the tract from which it performs job transfers between all reachable machines. We assume that job processing times are both machine and job independent, that jobs are not allowed to wait between two consecutive machines and that machine idle times are not allowed. We define a combined robot selection and scheduling problem (RSSP) for a set of Q non-identical robots characterized by different costs and job transfer and empty movement times. A solution to the RSSP problem is defined by (i) selecting a set of robots, (ii) assigning each robot to a portion of the track, and (iii) scheduling the robot moves. We define a robot schedule as feasible if all the jobs satisfy the no-wait condition and there are no machine idle times. The quality of the solutions are measured by two criteria (performance measures): makespan and robot selection cost. We study four different variations of the RSSP,one which is shown to be solvable in polynomial time while the other three turn out to be NP-hard. For the NP-hard, we show that a pseudo-polynomial time algorithm and a fully polynomial approximation scheme exists, and derive three important special cases which are solvable in polynomial time. The RSSP has aspects of robot selection, machine-robot assignment and robot movement scheduling. We believe this is the first time that this type of problem has been treated in the literature, and addresses a very important problem in multiple robotic systems operation. Our contribution lies in the formulation, methodology, algorithms for solution and complexity results which jointly treats all aspects of the problem simultaneously without the need to defer to heuristic decomposition methods.

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

[2]  S. S. Panwalkar,et al.  Scheduling of a Two-machine Flowshop with Travel Time Between Machines , 1991 .

[3]  Neta Amit,et al.  Openshop and flowshop scheduling to minimize sum of completion times , 1984, Comput. Oper. Res..

[4]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[5]  Daniel Oron,et al.  A note on flow-shop and job-shop batch scheduling with identical processing-time jobs , 2005, Eur. J. Oper. Res..

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

[7]  Konstantin Kogan,et al.  Scheduling a two-machine robotic cell: A solvable case , 1995, Ann. Oper. Res..

[8]  Andrew Lim,et al.  Two-machine flow shop problems with a single server , 2006, J. Sched..

[9]  Hiroshi Nagamochi,et al.  A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags , 2003, ISAAC.

[10]  Jerzy Kamburowski,et al.  On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..

[11]  Mauro Dell'Amico,et al.  Shop Problems With Two Machines and Time Lags , 1996, Oper. Res..

[12]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[13]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[14]  Chengbin Chu,et al.  Multi-degree cyclic scheduling of two robots in a no-wait flowshop , 2005, IEEE Transactions on Automation Science and Engineering.

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

[16]  Chengbin Chu,et al.  A polynomial algorithm for 2-degree cyclic robot scheduling , 2003, Eur. J. Oper. Res..

[17]  T. C. Edwin Cheng,et al.  Complexity of cyclic scheduling problems: A state-of-the-art survey , 2010, Comput. Ind. Eng..

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

[19]  Shi Ling,et al.  Complexity Results for Flow-shop Scheduling Problems with Transportation Delays and a Single Robot , 2011 .

[20]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

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

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

[23]  Sigrid Knust,et al.  Makespan minimization for flow-shop problems with transportation times and a single robot , 2001, Discret. Appl. Math..

[24]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[25]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[26]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[27]  Ada Che,et al.  Optimal Scheduling of Material Handling Devices in a PCB Production Line: Problem Formulation and a Polynomial Algorithm , 2008 .

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

[29]  Eugene Levner,et al.  An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times , 2006, Oper. Res. Lett..

[30]  Alexander A. Ageev,et al.  Approximation Algorithms for Scheduling Problems , 2009, Introduction to Scheduling.

[31]  Rubén Ruiz,et al.  Scheduling in Flowshops with No-Idle Machines , 2009 .

[32]  Chengbin Chu.  A faster polynomial algorithm for 2-cyclic robotic scheduling , 2006, J. Sched..

[33]  Funda Ergün,et al.  An improved FPTAS for Restricted Shortest Path , 2002, Inf. Process. Lett..

[34]  Toshihide Ibaraki,et al.  Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .

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

[36]  Ling Wang,et al.  Effective heuristics for the blocking flowshop scheduling problem with makespan minimization , 2012 .

[37]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[38]  Alessandro Agnetis,et al.  Part sequencing in three-machine no-wait robotic cells , 2000, Oper. Res. Lett..

[39]  Han Hoogeveen,et al.  Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..

[40]  Stefano Giordano,et al.  A survey on multi-constrained optimal path computation: Exact and approximate algorithms , 2010, Comput. Networks.

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

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

[43]  Sergey Sevastyanov,et al.  The flow shop problem with no-idle constraints: A review and approximation , 2009, Eur. J. Oper. Res..

[44]  Alain Guinet,et al.  Three stage no-idle flow-shops , 2003 .

[45]  Lixin Tang,et al.  Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration , 2009 .

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

[47]  Wenci Yu,et al.  The two-machine flow shop problem with delays and the one-machine total tardiness problem , 1996 .

[48]  Hiroshi Kise,et al.  ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER , 1991 .

[49]  Peter Brucker,et al.  A polynomial-time algorithm for a flow-shop batching problem with equal-length operations , 2011, J. Sched..

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

[51]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

[52]  Daniel Oron,et al.  Flow‐shop batch scheduling with identical processing‐time jobs , 2004 .

[53]  Helman I. Stern,et al.  Scheduling Parts in a Combined Production-transportation Work Cell , 1990 .

[54]  Chung Yee Lee,et al.  Two-machine shop scheduling with an uncapacitated interstage transporter , 2005 .