Minimization of earliness & Tardiness penalties with common due dates problem using Tabu search

This research relates to a single machine scheduling problem with objective is to minimize earliness & Tardiness penalties with common due dates. We proposed a heuristic method for finding initial solution as an input to the Tabu search algorithm for finding a near optimal solution for this problem. In our research study the due dates are restrictive with due date parameter h, ranges from 0.2, 0.4, 0.6 to 0.8. Our study is a paper base in which we have applied the Tabu search algorithm for the prescribe problem. The base paper of (Ronconi and Kawamura 2010) studied single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm) obtaining optimal solution. We compared the results of Tabu search algorithms with the base paper, Heuristic & benchmark results of D. Biskup and M. Feldmann. Our algorithm shows near optimal solution to the branch & bound algorithm.

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

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

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

[4]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

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

[6]  Débora P. Ronconi,et al.  The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm* , 2010 .

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

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

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

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

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

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

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

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

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