Exponential neighborhood search for a parallel machine scheduling problem

We consider the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a restrictive common due date. This problem is NP-hard in the strong sense. In this paper we define an exponential size neighborhood for this problem and prove that finding the local minimum in it is an NP-hard problem. The main contribution of this paper is to propose a pseudo-polynomial algorithm that finds the best solution of the exponential neighborhood. Additionally, we present some computational results.

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

[2]  Francis Sourd,et al.  Lower bounds for the earliness-tardiness scheduling problem on single and parallel machines Sa a , 2004 .

[3]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

[4]  Mesbah U. Ahmed,et al.  Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .

[5]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[6]  Han Hoogeveen,et al.  Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem , 2002, INFORMS J. Comput..

[7]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[8]  Francis Sourd.  Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints , 2006 .

[9]  Francis Sourd,et al.  Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints , 2006, Oper. Res. Lett..

[10]  Gerd Finke,et al.  Scheduling with common due date assignment , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[11]  Guoqing Wang,et al.  Parallel machine earliness and tardiness scheduling with proportional weights , 2003, Comput. Oper. Res..

[12]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

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

[14]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

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

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

[17]  Nicholas G. Hall.  Single- and multiple-processor models for minimizing completion time variance , 1986 .

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

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

[20]  Karl Ernst Osthaus.  Van de Velde , 1920 .

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

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

[23]  Frank Werner,et al.  On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties , 2004, Comput. Oper. Res..

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

[25]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[26]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[27]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

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

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

[30]  S. Sethi,et al.  Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems , 1990 .

[31]  Surya D. Liman,et al.  Earliness-tardiness scheduling problems with a common delivery window , 1994, Oper. Res. Lett..

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

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