Solving the Permutation Flow Shop Problem with Firefly Algorithm

Firefly algorithm (FA) is a new member of bionic swarm intelligence optimization algorithms. In this paper the bionic principle of FA is investigated and extended to solving a well-known NP-hard problem: Permutation Flow-Shop Scheduling Problem (PFSP). A corresponding solution strategy for PFSP bound is designed with its scheduling features. The strategy is implemented in experimentation on MATLAB workspace. At the end of the simulation, the experiment results verified that the effectiveness and feasibility offered by FA in solving the combinatorial PFSP optimization problems.

[1]  Jian Gao,et al.  An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem , 2013 .

[2]  Yang Xin-She.  マルチモーダル最適化のためのFireflyアルゴリズム | 文献情報 | J-GLOBAL 科学技術総合リンクセンター , 2009 .

[3]  Xiong Hegen.  Job shop scheduling problem based on particle swarm optimization , 2009 .

[4]  Mostafa Zandieh,et al.  A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times , 2011, J. Intell. Manuf..

[5]  Deming Lei,et al.  Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling , 2012 .

[6]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[7]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[8]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[9]  Jeffrey E. Schaller,et al.  A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness , 2013 .

[10]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[11]  Rui Zhang.  A Simulated Annealing-Based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness , 2013 .

[12]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

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

[14]  Pankaj Chandra,et al.  Permutation flow shop scheduling with earliness and tardiness penalties , 2004 .

[15]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

[16]  G. Vilcot,et al.  A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem , 2011 .