An effective shuffled frog-leaping algorithm for the flexible job-shop scheduling problem

As an extension of the classic job-shop scheduling problem (JSP), the flexible job-shop (FJSP) is NP-hard and has a wide application background. In this paper, a shuffled frog-leaping algorithm (SFLA) based algorithm is proposed for solving the FJSP. First, the SFLA employs a hybrid encoding scheme in which two sequences are used to illustrate both operation order sequence and machines assignment. Second, a special bi-Ievel crossover scheme as a local search scheme based on the critical path is incorporated in the framework of the memetic search. The searching ability of the modified SFLA can be well balanced between exploration and exploitation. Furthermore, the influence of the parameter setting is also investigated and suitable parameters are suggested. Numerical simulation and comparisons based on the well-known benchmark problems indicates the effectiveness of the SFLA for solving the problem.

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

[2]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

[3]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

[4]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

[5]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

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

[7]  X. Shao,et al.  A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem , 2010 .

[8]  Ye Xu,et al.  An Effective Shuffled Frog Leaping Algorithm for Solving Hybrid Flow-Shop Scheduling Problem , 2011, ICIC.

[9]  Nhu Binh Ho,et al.  An effective architecture for learning and evolving flexible job-shop schedules , 2007, Eur. J. Oper. Res..

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

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

[12]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[13]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[14]  Shu-Hsing Chung,et al.  Using the virtual cell concept for short-term production planning for flexible job shop manufacturing systems , 1993 .

[15]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

[16]  Jan Paulli,et al.  A hierarchical approach for the FMS scheduling problem , 1995 .

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

[18]  Quan-Ke Pan,et al.  An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems , 2010, Comput. Ind. Eng..

[19]  Felix T.S. Chan,et al.  Flexible job-shop scheduling problem under resource constraints , 2006 .

[20]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[21]  Joe H. Mize,et al.  Scheduling and control of flexible manufacturing systems: a critical review , 1994 .

[22]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[23]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[24]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).