A new ILS algorithm for parallel machine scheduling problems

This paper addresses the non-preemptive scheduling problem of scheduling jobs on identical parallel machines to minimize the maximum completion time or makespan. The problem has been proved to be NP-hard in the strong sense. The NP-hardness of the problem motivates us to develop a new methodology to obtain near-optimal solutions. We formulate the problem as an integer programming and then propose a new iterated local search (ILS) algorithm based on a variable number of cyclic exchanges to solve it. The properties of the solutions are derived and the results are used to improve the computational efficiency of our algorithm. Computational experiments show that the cyclic exchange neighborhood embedded in an iterated local search framework is effective for solving the scheduling problems with up to 1000 jobs and 40 machines within a reasonable amount of computation time.

[1]  Thomas Stützle,et al.  An Experimental Investigation of Iterated Local Search for Coloring Graphs , 2002, EvoWorkshops.

[2]  Steef L. van de Velde Duality-Based Algorithms for Scheduling Unrelated Parallel Machines , 1993, INFORMS J. Comput..

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

[4]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

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

[6]  Ravindra K. Ahuja,et al.  Very large-scale neighborhood search , 2000 .

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

[8]  M. Dorigo,et al.  Design of Iterated Local Search Algorithms An Example Application to the Single Machine Total Weighted Tardiness Problem , 2001 .

[9]  James B. Orlin,et al.  Theory of cyclic transfers , 1989 .

[10]  Richard K. Congram Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation , 2000 .

[11]  Abraham P. Punnen,et al.  Very Large-Scale Neighborhood Search , 2000, Handbook of Approximation Algorithms and Metaheuristics.

[12]  Peter Merz,et al.  An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering , 2003, IDA.

[13]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[14]  Thomas Stützle,et al.  A beginner's introduction to iterated local search , 2001 .

[15]  Matthijs den Besten,et al.  Design of Iterated Local Search Algorithms , 2001, EvoWorkshops.