Deterministic machine scheduling with release times and sequence-dependent setups using random-insertion heuristics

This paper considers the problem of scheduling a set of jobs on both a single machine and identical parallel machines settings with the objective of minimising the maximum completion time of all jobs (makespan). Jobs are subject to release dates and there are sequence-dependent setup times. Since this problem is known to be strongly NP-hard even for the single machine case, this paper proposes heuristic algorithms to solve it. Algorithm uses the advantages of random-variate generators as a strategy for the generation of various execution sequences, and then selects the best of such schedules. Experiments are performed using random-generated data from taken literature. Results show that the heuristics perform very well compared against the optimal solution, and requiring short computational time.

[1]  Eugene Levner,et al.  Cyclic Scheduling of Operations for a Part Type in an FMS Handled by a Single Robot: A Parametric Critical-Path Approach , 1998 .

[2]  Andrew Wirth,et al.  Equal processing and equal setup time cases of scheduling parallel machines with a single server , 2004, Comput. Oper. Res..

[3]  Ji-Bo Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect , 2008, Comput. Ind. Eng..

[4]  Chengbin Chu,et al.  Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times , 2008, Comput. Oper. Res..

[5]  Jairo R. Montoya-Torres,et al.  PRODUCTION SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS AND JOB RELEASE TIMES , 2010 .

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

[7]  David Alcaide,et al.  An approach to solve a hierarchical stochastic sequential ordering problem , 2003 .

[8]  Ana Paula F. D. Barbosa-Póvoa,et al.  A critical review on the design and retrofit of batch plants , 2007, Comput. Chem. Eng..

[9]  Javier Faulin,et al.  Solving the capacitated vehicle routing problem with maximum traveling distance and service time requirements: an approach based on Monte Carlo simulation , 2009, WSC '09.

[10]  Wieslaw Kubiak,et al.  Sequencing of parts and robot moves in a robotic cell , 1992 .

[11]  Milton Soto-Ferrari,et al.  Machine scheduling with sequence-dependent setup times using a randomized search heuristic , 2009, 2009 International Conference on Computers & Industrial Engineering.

[12]  Ronald G. Askin,et al.  Heuristic scheduling of parallel machines with sequence-dependent set-up times , 2001 .

[13]  Paul A. Rubin,et al.  A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times , 2000 .

[14]  Vinicius Amaral Armentano,et al.  A genetic algorithm for scheduling on a single machine with set-up times and due dates , 2000 .

[15]  Chengbin Chu,et al.  Cyclic multiple-robot scheduling with time-window constraints using a critical path approach , 2007, Eur. J. Oper. Res..

[16]  J. Wesley Barnes,et al.  Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs , 1981, Oper. Res..

[17]  Ana X. Halabi,et al.  Using randomization to solve the deterministic single and multiple vehicle routing problem with service time constraints , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[18]  Konstantin Kogan,et al.  A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots , 1998, Comput. Oper. Res..

[19]  Furkan Kiraç,et al.  A tabu search algorithm for parallel machine total tardiness problem , 2004, Comput. Oper. Res..

[20]  Andrew Wirth,et al.  Scheduling parallel machines with a single server: some solvable cases and heuristics , 2002, Comput. Oper. Res..

[21]  Reha Uzsoy,et al.  Production scheduling algorithms for a semiconductor test facility , 1991 .

[22]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

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

[24]  Nadia Brauner.  Identical part production in cyclic robotic cells: Concepts, overview and open questions , 2008, Discret. Appl. Math..

[25]  R. Bohn,et al.  Setup Time Reduction for Electronics Assembly: Combining Simple (SMED) and IT‐Based Methods , 2005 .

[26]  Ali Allahverdi,et al.  The significance of reducing setup times/setup costs , 2008, Eur. J. Oper. Res..

[27]  Barbara B. Flynn.  The effects of setup time on output capacity in cellular manufacturing , 1987 .

[28]  J. R. Brown,et al.  A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem , 1995 .

[29]  Reha Uzsoy,et al.  Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine , 1992 .

[30]  Eugene Levner,et al.  Cyclic Scheduling in Robotic Cells: An Extension of Basic Models in Machine Scheduling Theory , 2007 .

[31]  Lee J. Krajewski,et al.  Kanban, MRP, and Shaping the Manufacturing Environment , 1987 .

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

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

[34]  Yan Chen,et al.  Scheduling jobs on parallel machines with setup times and ready times , 2008, Comput. Ind. Eng..

[35]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[36]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with sequence-dependent setup effects , 2000, IEEE Trans. Robotics Autom..

[37]  Peter Brucker,et al.  Complexity results for parallel machine problems with a single server , 2002 .

[38]  Andrew Kusiak,et al.  Scheduling manufacturing systems , 1992 .

[39]  Meral Azizoglu,et al.  Dynamic programming algorithms for scheduling parallel machines with family setup times , 2001, Comput. Oper. Res..

[40]  Chelliah Sriskandarajah,et al.  Scheduling in robotic cells: Complexity and steady state analysis , 1998, Eur. J. Oper. Res..

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

[42]  Chengbin Chu,et al.  An exact method for Pm/sds, ri/sum(i=1, n, Ci) problem , 2007, Comput. Oper. Res..

[43]  Krzysztof Fleszar,et al.  A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem , 2004, Comput. Ind. Eng..

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

[45]  Christos T. Maravelias,et al.  Integration of production planning and scheduling: Overview, challenges and opportunities , 2009, Comput. Chem. Eng..

[46]  Marie-Ange Manier,et al.  A Classification for Hoist Scheduling Problems , 2003 .

[47]  Chengbin Chu.  Efficient heuristics to minimize total flow time with release dates , 1992, Oper. Res. Lett..

[48]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .

[49]  Angel A. Juan,et al.  The ALGACEA-1 method for the capacitated vehicle routing problem , 2008, Int. Trans. Oper. Res..

[50]  Jean G. Vaucher,et al.  SSJ: a framework for stochastic simulation in Java , 2002, Proceedings of the Winter Simulation Conference.

[51]  Fuh-Der Chou,et al.  A HEURISTIC ALGORITHM TO MINIMIZE TOTAL WEIGHTED TARDINESS ON A SINGLE MACHINE WITH RELEASE DATES AND SEQUENCE-DEPENDENT SETUP TIMES , 2004 .

[52]  G. Rinaldi,et al.  Scheduling tasks with sequence-dependent processing times , 1988 .

[53]  A. Guinet.  Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria , 1993 .

[54]  Eugene Levner,et al.  Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling , 2011, Comput. Ind. Eng..

[55]  Eugene Levner,et al.  Parametric algorithms for 2-cyclic robot scheduling with interval processing times , 2011, J. Sched..

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

[57]  Keah Choon Tan,et al.  Minimizing Tardiness on a Single Processor with Sequence Dependent Setup Times: A Simulated Annealing Approach , 1997 .

[58]  Marc Gravel,et al.  Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times , 2002, J. Oper. Res. Soc..

[59]  M. L. Wolfson,et al.  An Algorithm for Solving Job Sequencing Problems , 1967 .

[60]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[61]  Chelliah Sriskandarajah,et al.  Parallel machine scheduling with a common server , 2000, Discret. Appl. Math..

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

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

[64]  Chengbin Chu,et al.  An exact method for problem , 2007 .

[65]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[66]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[67]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..