Climbing Depth-bounded Discrepancy Search for Solving Flexible Job Shop Scheduling Problems

The Flexible Job Shop Scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a finite sub-set of candidate machines. The aim is to find an allocation for each operation and to define the se-quence of operations on each machine so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. Experiments have been performed on well-known benchmarks for flexible job shop scheduling.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  W. D. Harvey,et al.  Nonsystematic backtracking search , 1995 .

[3]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[4]  Nidhal Rezg,et al.  An integrated greedy heuristic for a flexible job shop scheduling problem , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[5]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[6]  Richard E. Korf,et al.  Improved Limited Discrepancy Search , 1996, AAAI/IAAI, Vol. 1.

[7]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

[9]  P. Lopez,et al.  Adaptation of Discrepancy-based Methods for Solving Hybrid Flow Shop Problems , 2006, 2006 International Conference on Service Systems and Service Management.

[10]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

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

[12]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[13]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[14]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[15]  Toby Walsh.  Depth-bounded Discrepancy Search , 1997, IJCAI.

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

[17]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

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

[19]  Marie-José Huguet,et al.  A limited discrepancy search method for solving disjunctive scheduling problems with resource flexibility , 2004 .

[20]  Rjm Rob Vaessens.  Generalized job shop scheduling : complexity and local search , 1995 .