Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

We consider the problem of scheduling a number of jobs on a single machine against a restrictive common due date. The paper consists of two parts: firstly a new and appropriate problem representation is developed. As the restrictive common due date problem is known to be intractable we decided, secondly, to apply meta-heuristics, namely evolutionary strategies, simulated annealing and threshold accepting. We demonstrate that our application of these meta-heuristics is efficient in obtaining near-optimal solutions by solving 140 benchmark problems with up to 1000 jobs. Furthermore, we compare their solution quality and find that a new variant of threshold accepting is superior to the other approaches.

[1]  W. Szwarc.  Single-machine scheduling to minimize absolute deviation of completion times from a common due date , 1989 .

[2]  Chris N. Potts,et al.  A comparison of local search methods for flow shop scheduling , 1996, Ann. Oper. Res..

[3]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[4]  T. C. Edwin Cheng,et al.  Single-machine scheduling with a common due window , 2001, Comput. Oper. Res..

[5]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[6]  Chae Y. Lee,et al.  Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights , 1995 .

[7]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[8]  Ross J. W. James.  Using tabu search to solve the common due date early/tardy machine scheduling problem , 1997, Comput. Oper. Res..

[9]  K. B. Haley,et al.  A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems , 1995 .

[10]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[11]  Ingo Althöfer,et al.  On the convergence of “Threshold Accepting” , 1991 .

[12]  H. G. Kahlbacher,et al.  A proof for the longest‐job‐first policy in one‐machine scheduling , 1991 .

[13]  J. A. Hoogeveen,et al.  Scheduling around a small common due date , 1991 .

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Paul Ablay,et al.  Ten Theses Regarding the Design of Controlled Evolutionary Strategies , 1989, Parallelism, Learning, Evolution.

[16]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[17]  M. Pirlot.  General local search methods , 1996 .

[18]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[19]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[20]  Chung-Yee Lee,et al.  Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date , 1991, Comput. Oper. Res..

[21]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[22]  Gary D. Scudder,et al.  On the Assignment of Optimal Due Dates , 1989 .

[23]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[24]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[25]  J. D. Becker,et al.  Parallelism, Learning, Evolution , 1991, Lecture Notes in Computer Science.

[26]  Volker Nissen,et al.  Evolutionary Algorithms in Management Applications , 1995 .

[27]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[28]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[29]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[30]  T. C. Edwin Cheng,et al.  Multiple-machine scheduling with earliness, tardiness and completion time penalties , 1999, Comput. Oper. Res..

[31]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[32]  Martin Feldmann,et al.  Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates , 2001, Comput. Oper. Res..

[33]  Ehl Emile Aarts,et al.  Statistical cooling : a general approach to combinatorial optimization problems , 1985 .

[34]  Suresh P. Sethi,et al.  Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..

[35]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..