Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

This study addresses a class of single-machine scheduling problems involving a common due date where the objective is to minimize the total job earliness and tardiness penalties. A genetic algorithm (GA) approach and a simulated annealing (SA) approach utilizing a greedy local search and three well-known properties in the area of common due date scheduling are developed. The developed algorithms enable the starting time of the first job not at zero and were tested using a set of benchmark problems. From the viewpoints of solution quality and computational expenses, the proposed approaches are efficient and effective for problems involving different numbers of jobs, as well as different processing time, and earliness and tardiness penalties.

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

[2]  Martin Feldmann,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches , 2003 .

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[5]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[6]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[7]  Madabhushi Raghavachari,et al.  A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..

[8]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

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

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

[12]  Karl Ernst Osthaus.  Van de Velde , 1920 .

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

[14]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[15]  Ching-Fang Liaw,et al.  A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem , 1999, Comput. Oper. Res..

[16]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[17]  H. G. Kahlbacher.  Scheduling with monotonous earliness and tardiness penalties , 1993 .

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

[19]  Jatinder N. D. Gupta,et al.  Two-Machine Flow Shop Scheduling with Nonregular Criteria , 2004, J. Math. Model. Algorithms.

[20]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[21]  Anup K. Sen,et al.  Single machine weighted earliness-tardiness penalty problem with a common due date , 2001, Comput. Oper. Res..

[22]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[23]  Débora P. Ronconi,et al.  Minimizing earliness and tardiness penalties in a single-machine problem with a common due date , 2005, Eur. J. Oper. Res..

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

[25]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .