A tabu search algorithm for the single machine total weighted tardiness problem

In this study, a tabu search (TS) approach to the single machine total weighted tardiness problem (SMTWT) is presented. The problem consists of a set of independent jobs with distinct processing times, weights and due dates to be scheduled on a single machine to minimize total weighted tardiness. The theoretical foundation of single machine scheduling with due date related objectives reveal that the problem is NP-hard, rendering it a challenging area for meta-heuristic approaches. This paper presents a totally deterministic TS algorithm with a hybrid neighborhood and dynamic tenure structure, and investigates the strength of several candidate list strategies based on problem specific characteristics in increasing the efficiency of the search. The proposed TS approach yields very high quality results for a set of benchmark problems obtained from the literature. � 2005 Elsevier B.V. All rights reserved.

[1]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[2]  Thomas E. Morton,et al.  Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .

[3]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[4]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[5]  Ram V. Rachamadugu,et al.  Accurate myopic heuristics for tardiness scheduling , 1984 .

[6]  T. C. Edwin Cheng,et al.  On the single machine total tardiness problem , 2005, Eur. J. Oper. Res..

[7]  Fred Glover,et al.  Tabu search methods for a single machine scheduling problem , 1991, J. Intell. Manuf..

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

[9]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

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

[11]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[12]  Furkan Kiraç,et al.  A tabu search algorithm for parallel machine total tardiness problem , 2004, Comput. Oper. Res..

[13]  Donald C Carroll,et al.  Heuristic sequencing of single and multiple component jobs. , 1965 .

[14]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[15]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[16]  Hirofumi Matsuo,et al.  A controlled search simulated annealing method for the single machine weighted tardiness problem , 1990 .

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

[18]  T. C. E. Cheng,et al.  Single machine scheduling to minimize total weighted tardiness , 2005, Eur. J. Oper. Res..

[19]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[20]  Christos Koulamas,et al.  A heuristic for the single machine tardiness problem , 1993 .

[21]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..