Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

[1]  Mehmet Fatih Tasgetiren,et al.  An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem , 2010, Appl. Math. Comput..

[2]  Xiangtao Li,et al.  An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure , 2013, Adv. Eng. Softw..

[3]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

[4]  Debahuti Mishra,et al.  A New Meta-heuristic Bat Inspired Classification Approach for Microarray Data , 2012 .

[5]  LiXiangtao,et al.  An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure , 2013 .

[6]  Xin-She Yang,et al.  Bat algorithm: a novel approach for global engineering optimization , 2012, 1211.6663.

[7]  Hartmut Stadtler,et al.  Supply chain management and advanced planning--basics, overview and challenges , 2005, Eur. J. Oper. Res..

[8]  Mehmet Mutlu Yenisey,et al.  A multi-objective ant colony system algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

[9]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  Mohammad Mirabi,et al.  A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem , 2013, The International Journal of Advanced Manufacturing Technology.

[11]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[12]  Ling Wang,et al.  Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer , 2011 .

[13]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[14]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .

[15]  Yangyang Li,et al.  A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling , 2013, TheScientificWorldJournal.

[16]  Amir Hossein Gandomi,et al.  Bat algorithm for constrained optimization tasks , 2012, Neural Computing and Applications.

[17]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..

[18]  Bassem Jarboui,et al.  An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..

[19]  Lin-Yu Tseng,et al.  A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[20]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[21]  Germán Terrazas,et al.  Nature Inspired Cooperative Strategies for Optimization, NICSO 2010, May 12-14, 2010, Granada, Spain , 2012, NISCO.

[22]  Jian Xie,et al.  A Novel Bat Algorithm Based on Differential Operator and Lévy Flights Trajectory , 2013, Comput. Intell. Neurosci..

[23]  Victor Fernandez-Viagas,et al.  On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem , 2014, Comput. Oper. Res..

[24]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[25]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

[26]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[27]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[28]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[29]  Gaige Wang,et al.  A Bat Algorithm with Mutation for UCAV Path Planning , 2012, TheScientificWorldJournal.

[30]  Fardin Ahmadizar,et al.  A new ant colony algorithm for makespan minimization in permutation flow shops , 2012, Comput. Ind. Eng..