Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

This paper focuses on scheduling jobs with different processing times and distinct due dates on a single machine with no inserted idle time as to minimize the sum of total earliness and tardiness. This scheduling problem is a very important and frequent industrial problem that is common to most just-in-time production environments. This NP hard scheduling problem is herein solved using a hybrid heuristic which combines local search heuristics (dispatching rules, hill climbing and simulated annealing) and an evolutionary algorithm based on genetic algorithms. The heuristic involves low and high, relay and teamwork hybridization. Computational results reflect the sizeable solution quality improvement induced by hybridization, and assess the impact of each type of hybridization on the efficiency of the hybrid heuristic.

[1]  Sakib A. Mondal.  Minimization of squared deviation of completion times about a common due date , 2002, Comput. Oper. Res..

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

[3]  Wlodzimierz Szwarc.  The weighted common due date single machine scheduling problem revisited , 1996, Comput. Oper. Res..

[4]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[5]  Safia Kedad-Sidhoum,et al.  The One-Machine Problem with Earliness and Tardiness Penalties , 2003, J. Sched..

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

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

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

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

[10]  M. Azizoglu,et al.  Bicriteria scheduling problem involving total tardiness and total earliness penalties , 1991 .

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

[12]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[13]  Francis Sourd,et al.  An efficient algorithm for the earliness-tardiness scheduling problem , 2005 .

[14]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[15]  Maria Teresa Almeida,et al.  A composite heuristic for the single machine early/tardy job scheduling problem , 1998, Comput. Oper. Res..

[16]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[17]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[18]  B. Alidaee,et al.  A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date , 1997 .

[19]  J. Blackstone,et al.  Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .

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

[21]  Candace Arai Yano,et al.  Algorithms for a class of single-machine weighted tardiness and earliness problems , 1991 .

[22]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[23]  Candace Arai Yano,et al.  Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates , 1994 .

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

[25]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[26]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[27]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

[28]  Pei-Chann Chang.  A branch and bound approach for single machine scheduling with earliness and tardiness penalties , 1999 .

[29]  Jose A. Ventura,et al.  Single machine scheduling with symmetric earliness and tardiness penalties , 2003, Eur. J. Oper. Res..

[30]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[31]  Jose A. Ventura,et al.  Scheduling about a given common due date to minimize mean squared deviation of completion times , 1996 .

[32]  Jorge M. S. Valente,et al.  Improved heuristics for the early/tardy scheduling problem with no idle time , 2005, Comput. Oper. Res..

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

[34]  Francis Sourd,et al.  Optimal timing of a sequence of tasks with general completion costs , 2005, Eur. J. Oper. Res..

[35]  George Z. Li.  Single machine earliness and tardiness scheduling , 1997 .

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