Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem

Given a set of jobs with associated processing times, and a set of identical machines, each of which can process at most one job at a time, the parallel machine scheduling problem is to assign each job to exactly one machine so as to minimize the maximum completion time of a job. The problem is strongly NP-hard and has been intensively studied since the 1960s. We present a metaheuristic and an exact algorithm and analyze their average behavior on a large set of test instances from the literature. The metaheuristic algorithm, which is based on a scatter search paradigm, computationally proves to be highly effective and capable of solving to optimality a very high percentage of the publicly available test instances. The exact algorithm, which is based on a specialized binary search and a branch-and-price scheme, was able to quickly solve to optimality all remaining instances.

[1]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[2]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[3]  Paolo Toth,et al.  Worst-case analysis of greedy algorithms for the subset-sum problem , 1984, Math. Program..

[4]  A. Frangioni,et al.  A multi-exchange neighborhood for minimum makespan machine , 2000 .

[5]  F. Glover,et al.  Scatter Search and Path Relinking: Foundations and Advanced Designs , 2004 .

[6]  Celso C. Ribeiro,et al.  A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling , 2004, WEA.

[7]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[8]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[9]  Ethel Mokotoff,et al.  Production , Manufacturing and Logistics An exact algorithm for the identical parallel machine scheduling problem , 2003 .

[10]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[11]  M. Fischetti,et al.  A hybrid algorithm for finding thekth smallest ofn elements in O(n) time , 1988 .

[12]  Jeffrey D. Ullman,et al.  L worst-case performance bounds for rumple one-dimensional packing algorithms siam j , 1974 .

[13]  Mauro Dell'Amico,et al.  Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem , 2004, J. Heuristics.

[14]  Michel Gendreau,et al.  A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective , 1994, Comput. Oper. Res..

[15]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[16]  Ethel Mokotoff,et al.  List scheduling algorithms to minimize the makespan on identical parallel machines , 2001 .

[17]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[18]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

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

[20]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .

[21]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[22]  Maria Grazia Scutellà,et al.  A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems , 2004, J. Comb. Optim..

[23]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[24]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[25]  Mauro Dell'Amico,et al.  A note on exact algorithms for the identical parallel machine scheduling problem , 2005, Eur. J. Oper. Res..

[26]  S. Martello,et al.  Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[27]  Bo Chen,et al.  Parallel Scheduling for Early Completion , 2004, Handbook of Scheduling.

[28]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

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

[30]  Mauro Dell'Amico,et al.  Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..

[31]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[32]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .