A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine

In this paper, a discrete differential evolution (DDE) algorithm is presented to solve the single machine total earliness and tardiness penalties with a common due date. A new binary swap mutation operator called Bswap is presented. In addition, the DDE algorithm is hybridized with a local search algorithm to further improve the performance of the DDE algorithm. The performance of the proposed DDE algorithm is tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library. The computational experiments showed that the proposed DDE algorithm has generated better results than those in the literature in terms of both solution quality and computational time

[1]  Francis Sourd,et al.  Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem , 2006, Eur. J. Oper. Res..

[2]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

[3]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .

[4]  Andreas C. Nearchou,et al.  A differential evolution approach for the common due date early/tardy job scheduling problem , 2008, Comput. Oper. Res..

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

[6]  Shuo-Yan Chou,et al.  A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date , 2007, Eur. J. Oper. Res..

[7]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

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

[9]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

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

[11]  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..

[12]  Jae Young Choi,et al.  A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights , 1995, Comput. Oper. Res..

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

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

[15]  Mehmet Fatih Tasgetiren,et al.  A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[17]  Rym M'Hallah,et al.  Minimizing total earliness and tardiness on a single machine using a hybrid heuristic , 2007, Comput. Oper. Res..

[18]  Mehmet Fatih Tasgetiren,et al.  Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm , 2006, ANTS Workshop.