A general approach for optimizing regular criteria in the job-shop scheduling problem

Even though a very large number of solution methods has been developed for the job-shop scheduling problem, a majority has been designed for the makespan criterion. In this paper, we propose a general approach for optimizing any regular criterion in the job-shop scheduling problem. The approach is a local search method that uses a disjunctive graph model and neighborhoods generated by swapping critical arcs. The connectivity property of the neighborhood structure is proved and a novel efficient method for evaluating moves is presented. Besides its generality, another prominent advantage of the proposed approach is its simple implementation that only requires to tune the range of one parameter. Extensive computational experiments carried out on various criteria (makespan, total weighted flow time, total weighted tardiness, weighted sum of tardy jobs, maximum tardiness) show the efficiency of the proposed approach. Best results were obtained for some problem instances taken from the literature.

[1]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

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

[3]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

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

[5]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[6]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[7]  Taeyong Yang,et al.  An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling , 1996 .

[8]  Dong X. Shaw,et al.  Complexity of the ELSP with general cyclic schedules , 1997 .

[9]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[10]  Joseph A. Svestka,et al.  A bi-directional scheduling approach for job shops , 1999 .

[11]  Emanuela Merelli,et al.  A tabu search method guided by a shifting bottleneck for a job shop scheduling , 2000 .

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

[13]  Reha Uzsoy,et al.  A shifting bottleneck algorithm for scheduling semiconductor testing operations , 1992 .

[14]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

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

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

[17]  Erik D. Goodman,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem , 1997, ICGA.

[18]  Chandrasekharan Rajendran,et al.  Efficient jobshop dispatching rules: Further developments , 2000 .

[19]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[20]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

[21]  Tai-Yue Wang,et al.  A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems , 2000, Int. J. Syst. Sci..

[22]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

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

[24]  Stéphane Dauzère-Pérès,et al.  Multi-resource shop scheduling with resource flexibility , 1998, Eur. J. Oper. Res..

[25]  Pascal Van Hentenryck,et al.  Scheduling Abstractions for Local Search , 2004, CPAIOR.

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

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

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

[29]  Hiroshi Ohta,et al.  A heuristic for job shop scheduling to minimize total weighted tardiness , 2002 .

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

[31]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[32]  James S. Noble,et al.  An approach to job shop scheduling with sequence-dependent setups , 1999 .

[33]  Kuei-Bin Wu,et al.  An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm , 1999, Int. J. Syst. Sci..

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

[35]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

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

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

[38]  Peter Ross,et al.  A Genetic Algorithm for Job-Shop Problems with Various Schedule Quality Criteria , 1996, Evolutionary Computing, AISB Workshop.

[39]  Hong Zhou,et al.  Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm , 2009, Eur. J. Oper. Res..

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

[41]  Vijay K. Vaishnavi,et al.  Computing Point Enclosures , 1982, IEEE Transactions on Computers.

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