An integrated search heuristic for large-scale flexible job shop scheduling problems

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem (JSP), where each operation is allowed to be processed by any machine from a given set, rather than one specified machine. In this paper, two algorithm modules, namely hybrid harmony search (HHS) and large neighborhood search (LNS), are developed for the FJSP with makespan criterion. The HHS is an evolutionary-based algorithm with the memetic paradigm, while the LNS is typical of constraint-based approaches. To form a stronger search mechanism, an integrated search heuristic, denoted as HHS/LNS, is proposed for the FJSP based on the two algorithms, which starts with the HHS, and then the solution is further improved by the LNS. Computational simulations and comparisons demonstrate that the proposed HHS/LNS shows competitive performance with state-of-the-art algorithms on large-scale FJSP problems, and some new upper bounds among the unsolved benchmark instances have even been found.

[1]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[2]  Liang Gao,et al.  A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers , 2011, Appl. Soft Comput..

[3]  Mohamed Haouari,et al.  Discrepancy search for the flexible job shop scheduling problem , 2010, Comput. Oper. Res..

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

[5]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[6]  Stephen F. Smith,et al.  Applying constraint satisfaction techniques to job shop scheduling , 1997, Ann. Oper. Res..

[7]  J. Christopher Beck,et al.  Principles for the Design of Large Neighborhood Search , 2009, J. Math. Model. Algorithms.

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

[9]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[10]  J. Christopher Beck,et al.  Combining Constraint Programming and Local Search for Job-Shop Scheduling , 2011, INFORMS J. Comput..

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

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

[13]  Wojciech Bozejko,et al.  Parallel Meta2heuristics for the Flexible Job Shop Problem , 2010, ICAISC.

[14]  Pascal Van Hentenryck,et al.  A constraint-based architecture for local search , 2002, OOPSLA '02.

[15]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

[16]  Mostafa Zandieh,et al.  An artificial immune algorithm for the flexible job-shop scheduling problem , 2010, Future Gener. Comput. Syst..

[17]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[18]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[19]  Wim Nuijten,et al.  Randomized Large Neighborhood Search for Cumulative Scheduling , 2005, ICAPS.

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

[21]  K. Lee,et al.  A new metaheuristic algorithm for continuous engineering optimization : harmony search theory and practice , 2005 .

[22]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[24]  Stephen F. Smith,et al.  Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems , 2000, AAAI/IAAI.

[25]  Yuping Wang,et al.  A new hybrid genetic algorithm for job shop scheduling problem , 2012, Comput. Oper. Res..

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

[27]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[28]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

[29]  Pascal Van Hentenryck,et al.  Large Neighborhood Search for Dial-a-Ride Problems , 2011, CP.

[30]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[31]  Pascal Van Hentenryck,et al.  Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling , 2011, IJCAI.

[32]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[33]  Stephen F. Smith,et al.  Iterative Flattening Search for the Flexible Job Shop Scheduling Problem , 2011, IJCAI.

[34]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[35]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[36]  Yoshikazu Nishikawa,et al.  A Parallel Genetic Algorithm based on a Neighborhood Model and Its Application to Jobshop Scheduling , 1993, PPSN.