A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem

This paper considers the job-shop problem with release dates and due dates, with the objective of minimizing the total weighted tardiness. A genetic algorithm is combined with an iterated local search that uses a longest path approach on a disjunctive graph model. A design of experiments approach is employed to calibrate the parameters and operators of the algorithm. Previous studies on genetic algorithms for the job-shop problem point out that these algorithms are highly depended on the way the chromosomes are decoded. In this paper, we show that the efficiency of genetic algorithms does no longer depend on the schedule builder when an iterated local search is used. Computational experiments carried out on instances of the literature show the efficiency of the proposed algorithm.

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

[2]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[3]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

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

[5]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

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

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

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

[9]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[10]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[11]  Christian Bierwirth,et al.  An efficient genetic algorithm for job shop scheduling with tardiness objectives , 2004, Eur. J. Oper. Res..

[12]  Mauricio G. C. Resende,et al.  A hybrid genetic algorithm for the job shop scheduling problem , 2005, Eur. J. Oper. Res..

[13]  S. Kreipl.  A large step random walk for minimizing total weighted tardiness in a job shop , 2000 .

[14]  Tung-Kuan Liu,et al.  Improved genetic algorithm for the job-shop scheduling problem , 2006 .

[15]  Vinicius Amaral Armentano,et al.  Tabu search for minimizing total tardiness in a job shop , 2000 .

[16]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[17]  Michael Pinedo,et al.  A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[18]  Michael Pinedo,et al.  A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops , 1998 .

[19]  Marcos Singer,et al.  Decomposition methods for large job shops , 2001, Comput. Oper. Res..

[20]  Y Takeshi,et al.  GENETIC ALGORITHMS FOR JOB-SHOP SCHEDULING PROBLEMS , 1997 .

[21]  Emanuel Falkenauer,et al.  A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

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