A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time

In this paper, we consider m-machine flow shop scheduling problems FSSPs. The objective is to schedule the available n jobs to minimise the total flow time. The flow shop scheduling problems have been proved to be strongly non-deterministic polynomial-time hard NP-hard. Hence, exact methods cannot be used to solve even small size problems. Researchers addressed many heuristics and meta-heuristics to solve the problems. Firefly algorithm FA is one of the recently developed meta-heuristic algorithms. We propose a hybrid discrete firefly algorithm HDFA to solve the FSSPs to minimise the total flow time. To validate the performances of the HDFA, computational experiments are conducted on a number of randomly generated test problems with different parameters and the results proved the effectiveness of the proposed algorithm.

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

[2]  Quan-Ke Pan,et al.  Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .

[3]  Lin-Yu Tseng,et al.  A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem , 2010 .

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

[5]  Leandro dos Santos Coelho,et al.  Firefly algorithm approach based on chaotic Tinkerbell map applied to multivariable PID controller tuning , 2012, Comput. Math. Appl..

[6]  Zhihua Cui,et al.  Artificial Plant Optimization Algorithm with Correlation Branches , 2013 .

[7]  M. Yamashiro,et al.  Solving flow shop scheduling problems by quantum differential evolutionary algorithm , 2010 .

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

[9]  Stanley F. Bullington,et al.  An effective heuristic for flow shop problems with total flow time as criterion , 1993 .

[10]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[11]  M. K. Marichelvam,et al.  SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM , 2013, SOCO 2013.

[12]  A. Gandomi,et al.  Mixed variable structural optimization using Firefly Algorithm , 2011 .

[13]  Almoataz Y. Abdelaziz,et al.  Using the Harmony Search Algorithm for Reconfiguration of Power Distribution Networks with Distributed Generation Units , 2013 .

[14]  Lixin Tang,et al.  A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time , 2002, J. Intell. Manuf..

[15]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[16]  M. Sayadi,et al.  A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems , 2010 .

[17]  Janez Brest,et al.  A comprehensive review of firefly algorithms , 2013, Swarm Evol. Comput..

[18]  K. Vaisakh,et al.  Environmental Constrained Economic Dispatch by Modified Shuffled Frog Leaping Algorithm , 2013 .

[19]  Xiaoping Li,et al.  Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..

[20]  S. Kazemzadeh Azad,et al.  OPTIMUM DESIGN OF STRUCTURES USINGAN IMPROVED FIREFLYALGORITHM , 2011 .

[21]  Xin-She Yang,et al.  A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduling Problems , 2014, IEEE Transactions on Evolutionary Computation.

[22]  Marcelo Seido Nagano,et al.  Reducing mean flow time in permutation flow shop , 2008, J. Oper. Res. Soc..

[23]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[24]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[25]  K. Chandrasekaran,et al.  Network and reliability constrained unit commitment problem using binary real coded firefly algorithm , 2012 .

[26]  Xin-She Yang,et al.  Multiobjective firefly algorithm for continuous optimization , 2012, Engineering with Computers.

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

[28]  Hema Banati,et al.  Fire Fly Based Feature Selection Approach , 2011 .

[29]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[30]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[31]  Rabindra Kumar Sahu,et al.  Application of Gravitational Search Algorithm for Load Frequency Control of Multi Area Power System , 2013 .

[32]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[33]  V. Mani,et al.  Clustering using firefly algorithm: Performance study , 2011, Swarm Evol. Comput..

[34]  Amir Hossein Gandomi,et al.  Firefly Algorithm for solving non-convex economic dispatch problems with valve loading effect , 2012, Appl. Soft Comput..

[35]  Ming-Huwi Horng,et al.  Vector quantization using the firefly algorithm for image compression , 2012, Expert Syst. Appl..

[36]  Swagatam Das,et al.  A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem , 2013, Int. J. Bio Inspired Comput..

[37]  Thatchai Thepphakorn,et al.  Application of Firefly Algorithm and Its Parameter Setting for Job Shop Scheduling , 2012 .

[38]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

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

[40]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[41]  Leandro Fleck Fadel Miguel,et al.  Multimodal size, shape, and topology optimisation of truss structures using the Firefly algorithm , 2013, Adv. Eng. Softw..

[42]  Xiao Xu,et al.  An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization , 2011, Expert Syst. Appl..

[43]  WUCheng,et al.  An Efficient Constructive Heuristic for Permutation Flow Shops to Minimize Total Flowtime , 2005 .

[44]  Chandrasekharan Rajendran,et al.  Two ant-colony algorithms for minimizing total flowtime in permutation flowshops , 2005, Comput. Ind. Eng..

[45]  Rasaratnam Logendran,et al.  Total flow time minimization in a flowshop sequence-dependent group scheduling problem , 2010, Comput. Oper. Res..

[46]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

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

[48]  Habiba Drias,et al.  ACO approach with learning for preemptive scheduling of real-time tasks , 2010, Int. J. Bio Inspired Comput..

[49]  Xiaoping Li,et al.  Estimation of distribution algorithm for permutation flow shops with total flowtime minimization , 2011, Comput. Ind. Eng..

[50]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[51]  S. Bansal.  Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .

[52]  Mariappan Kadarkarainadar Marichelvam,et al.  An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems , 2012, Int. J. Bio Inspired Comput..

[53]  Uday Kumar Chakraborty,et al.  Floating-point to integer mapping schemes in differential evolution for permutation flow shop scheduling , 2010, Int. J. Bio Inspired Comput..

[54]  Michal Czapinski,et al.  Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum , 2010, Comput. Ind. Eng..