A block approach to earliness-tardiness scheduling problems

In this paper, we consider a single-machine job scheduling problem where the objective is to minimize the weighted sum of earliness and tardiness (E/T) penalties of jobs. This problem is consistent with the just-in-time (JIT) production. We propose partitioning of permutation into subsequences (blocks) and replacing sets of moves with its representatives, significantly decreasing the size of the searched neighborhood. Some new properties of the problem and compound moves make eliminating “bad” elements and speeding up calculations possible. These properties allow us to propose a new fast local search algorithm based on a tabu search method. Computational experiments are presented and the results show that the algorithm proposed allows us to obtain the best-known results in a short time.

[1]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[2]  Jeffrey E. Schaller.  Single machine scheduling with early and quadratic tardy penalties , 2004, Comput. Ind. Eng..

[3]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

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

[5]  Han Hoogeveen,et al.  A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time , 1996, INFORMS J. Comput..

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

[7]  Wojciech Bozejko,et al.  Task Realization's Optimization with Earliness and Tardiness Penalties in Distributed Computation Systems , 2005, AWIC.

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

[9]  Wojciech Bozejko,et al.  A Neuro-tabu Search Algorithm for the Job Shop Problem , 2010, ICAISC.

[10]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

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

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

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

[14]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

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

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

[18]  Russell J. Hemley,et al.  A pressing matter , 2006 .

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

[20]  Tung-I Tsai,et al.  A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times , 2007 .

[21]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

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

[23]  Frank Werner,et al.  Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties , 2001 .

[24]  Wojciech Bozejko,et al.  Block approach - tabu search algorithm for single machine total weighted tardiness problem , 2006, Comput. Ind. Eng..

[25]  W. Szwarc.  Adjacent orderings in single-machine scheduling with earliness and tardiness penalties , 1993 .