Tabu search for minimizing total tardiness in a job shop

Abstract This paper presents a tabu search approach to minimize total tardiness for the job shop scheduling problem. The method uses dispatching rules to obtain an initial solution and searches for new solutions in a neighborhood based on the critical paths of the jobs. Diversification and intensification strategies are suggested. For small problems the solutions’ quality is evaluated against optimal solution values and for large problems the tabu search performance is compared with two heuristics proposed in the literature.

[1]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[2]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[3]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[4]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[5]  Cihan H. Dagli,et al.  Genetic neuro-scheduler: A new approach for job shop scheduling , 1995 .

[6]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[7]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[8]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[9]  Fred W. Glover,et al.  A study of diversification strategies for the quadratic assignment problem , 1994, Comput. Oper. Res..

[10]  אסתר טולדנו,et al.  מקבלי דמי אבטלה בשנת 1996 , 1997 .

[11]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[12]  Jack C. Hayya,et al.  Priority dispatching with operation due dates in a job shop , 1982 .

[13]  Narayan Raman,et al.  The job shop tardiness problem: A decomposition approach , 1993 .

[14]  Sinchai Sittisathanchai.  Genetic-neuro scheduler , 1994 .

[15]  Kenneth R. Baker,et al.  Job shop scheduling with modified due dates , 1983 .

[16]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[17]  Taeyong Yang,et al.  A MULTIPLE-PASS HEURISTIC RULE FOR JOB-SHOP SCHEDULING WITH DUE-DATES , 1993 .

[18]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[19]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

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

[21]  אלחנן בלומנטל.  שיקום נכים 1971 - 1972 , 1974 .

[22]  Jadranka Skorin-Kapov,et al.  Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..

[23]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[24]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[25]  Edward Anderson,et al.  Two new rules to minimize tardiness in a job shop , 1990 .