Heuristic scheduling of parallel machines with sequence-dependent set-up times

In many manufacturing environments, multiple processing stations are used in parallel to obtain adequate capacity. Likewise, in many production environments, set-up activities are required for switching between items. This work addresses scheduling in parallel machines with sequence dependent set-up times and possibly non-zero ready times with the goal of minimizing makespan. Non-zero ready times allow for application in a continuous planning environment and will also support the expansion of the current model to a multistage production environment. An integer programming formulation is presented. Several heuristics, including approaches based on MULTI-FIT, genetic algorithms and the travelling salesman problem, are then developed and compared empirically. Seven factors are identified in order to generate problem data, including the number of parallel machines, the average number of jobs per machine, set-up time distribution parameters and processing time distribution parameters. The set-up time matrix can be either symmetric or asymmetric but must satisfy the triangle inequality. A modified insertion heuristic is found to perform best for these types of problems.

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

[2]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[3]  Edward G. Coffman,et al.  Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[4]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[5]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[6]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[7]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[8]  Edward G. Coffman,et al.  A generalized bound on LPT sequencing , 1976, SIGMETRICS '76.

[9]  R. A. Holmes,et al.  On the Use of A Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs , 1977 .

[10]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[11]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[12]  Donald K. Friesen,et al.  Tighter Bounds for the Multifit Processor Scheduling Algorithm , 1984, SIAM J. Comput..

[13]  Iain D. Craig.  Genetic Algorithms and Simulated Annealing edited by Lawrence Davis Pitman, London, 1987 (£19.95) , 1988, Robotica.

[14]  Chung-Yee Lee,et al.  Multiprocessor scheduling: combining LPT and MULTIFIT , 1988, Discret. Appl. Math..

[15]  Gabriel R. Bitran,et al.  Sequencing production on parallel machines with two magnitudes of sequence dependent setup costs , 1989 .

[16]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[17]  Christopher S. Tang.  Scheduling batches on parallel machines with major and minor set-ups , 1990 .

[18]  John S. Morris,et al.  A simulation analysis of factors influencing the attractiveness of group technology cellular layouts , 1990 .

[19]  James D. Blocher,et al.  Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm , 1991 .

[20]  J. Rajgopal,et al.  On scheduling parallel machines with two setup classes , 1991 .

[21]  Amos Fiat,et al.  New algorithms for an ancient scheduling problem , 1992, STOC '92.

[22]  Reha Uzsoy,et al.  Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times , 1993, Oper. Res. Lett..

[23]  Monique Guignard-Spielberg,et al.  Solving Makespan Minimization Problems with Lagrangean Decomposition , 1993, Discret. Appl. Math..

[24]  Clyde L. Monma,et al.  Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, Oper. Res..

[25]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[26]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[27]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[28]  Abraham P. Punnen,et al.  Minmax combinatorial optimization , 1995 .

[29]  Guochuan Zhang,et al.  A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer , 1997, Inf. Process. Lett..

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

[31]  Yu Gu,et al.  GENETIC ALGORITHM APPROACH TO AIRCRAFT GATE REASSIGNMENT PROBLEM , 1999 .

[32]  Marin Golub,et al.  Scheduling Multiprocessor Tasks with Genetic Algorithms , 2019 .