Minimizing Arbitrary Earliness/Tardiness Penalties with Common Due Date in Single-Machine Scheduling Problem Using a Tabu-Geno-Simulated Annealing

In this paper, the single machine scheduling problem for a common due date with arbitrary earliness/tardiness penalties is discussed. The objective is to determine the common due date and processing sequence of new jobs together with the re-sequencing of old jobs to minimize the sum of total earliness/tardiness (E/T), completion time, and due date (dd) related penalties. We propose a new approach Tabu-Geno-Simulated Annealing (TGSA) by hybridization of three well-known metaheuristics, which have proven to be effective for this non deterministic polynomial time (NP) hard scheduling problem, namely, genetic algorithms (GA), tabu search, and simulated annealing (SA). Computational results have shown the effectiveness of the proposed approach in comparison with the ad-hoc heuristics on various single-machine scheduling problems. The assessment of the proposed hybridization indicates the efficiency in both the result and the time versus the other methods.

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

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

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

[4]  Yih-Long Chang,et al.  MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

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

[6]  Yih-Long Chang,et al.  Minimizing Mean Squared Deviation of Completion Times About a Common Due Date , 1987 .

[7]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

[8]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

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

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

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

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

[13]  Jose A. Ventura,et al.  A note on ‘Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’ , 1994 .

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

[15]  Belarmino Adenso-Díaz,et al.  An SA/TS mixture algorithm for the scheduling tardiness problem , 1996 .

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

[17]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[18]  Reha Uzsoy,et al.  Rescheduling on a single machine with part-type dependent setup times and deadlines , 1997, Ann. Oper. Res..

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

[20]  Meral Azizoglu,et al.  Scheduling job families about an unrestricted common due date on a single machine , 1997 .

[21]  A. Gupta,et al.  A GENETIC ALGORITHM FOR SCHEDULING JOB FAMILIES ON A SINGLE MACHINE WITH ARBITRARY EARLINESS/TARDINESS PENALTIES AND AN UNRESTRICTED COMMON DUE DATE , 1998 .

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

[23]  Dingwei Wang,et al.  Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties , 1999, Int. J. Syst. Sci..

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

[25]  T.C.E. Cheng,et al.  Due-date determination with resequencing , 1999 .

[26]  D. Biskup,et al.  Single-machine scheduling for minimizing earliness and tardiness penalties by metaheuristic approaches , 2002 .

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

[28]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[29]  Peter Winker,et al.  Applications of optimization heuristics to estimation and modelling problems , 2004, Comput. Stat. Data Anal..

[30]  Manoj Kumar Tiwari,et al.  Hybrid tabu-simulated annealing based approach to solve multi-constraint product mix decision problem , 2005, Expert Syst. Appl..

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

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