Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence

This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence for single and parallel machines with the run-time complexities of O(n log n) and O(mn2 log n) respectively, where n is the number of jobs and m the number of machines. The algorithms take a sequence consisting of all the jobs (Ji, i = 1,2,...,n) as input and distribute the jobs to machines (for m>1) along with their best completion times so as to get the least possible total penalty for this sequence. We prove the optimality for the single machine case and the runtime complexities of both. Henceforth, we present the results for the benchmark problems and compare with previous work for both single and parallel machine cases, up to 200 jobs.

[1]  T.C.E. Cheng.  Optimal due-date assignment and sequencing in a single machine shop , 1989 .

[2]  Peter Salamon,et al.  Facts, Conjectures, and Improvements for Simulated Annealing , 1987 .

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

[4]  Ertan Güner,et al.  The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration , 2010, Expert Syst. Appl..

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

[6]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

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

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

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

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

[11]  Maher Rebai,et al.  Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods , 2010, Journal of Intelligent Manufacturing.

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

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

[14]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[15]  Jin-Lee Kim.  Genetic algorithm stopping criteria for optimization of construction resource scheduling problems , 2013 .

[16]  S. S. Panwalkar,et al.  Optimal assignment of due-dates for a single processor scheduling problem , 1981 .

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