Solving tri-objective multistage hybrid flow shop scheduling problems using a discrete firefly algorithm

Hybrid flow shop (HFS) scheduling problems turn into a fascinating area of research for the past several decades. However, most of the researchers consider only single objective and makespan is the most vital objective function. The real industrial scheduling problems involve multiple conflicting objectives. The HFS scheduling problems were proved to be NP-hard (non-deterministic polynomial time hard) problems. In this paper, we present a discrete firefly algorithm (DFA) to minimise the makespan, total flow time and machine idle time in a multistage HFS environment consisting of n jobs and k stages with identical parallel machines. The performance of the proposed algorithm is tested with a real industrial case study data and random problem instances. Computational results proved the effectiveness of the proposed algorithm.

[1]  Xin-She Yang,et al.  Firefly algorithm, stochastic test functions and design optimisation , 2010, Int. J. Bio Inspired Comput..

[2]  Nadia Chaabane,et al.  MILP methods for the S-stage flexible flow shop scheduling problem , 2012 .

[3]  Xin-She Yang,et al.  Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan , 2014, Appl. Soft Comput..

[4]  R. Suresh,et al.  Pareto archived simulated annealing for job shop scheduling with multiple objectives , 2006 .

[5]  S. Karthikeyan,et al.  A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints , 2014, The International Journal of Advanced Manufacturing Technology.

[6]  Xin-She Yang,et al.  Solving hybrid flow shop scheduling problems using bat algorithm , 2013 .

[7]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[8]  Xin-She Yang,et al.  Firefly Algorithm: Recent Advances and Applications , 2013, ArXiv.

[9]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

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

[11]  Mostafa Zandieh,et al.  A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic , 2009, Expert Syst. Appl..

[12]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .

[13]  T. Yang *,et al.  Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study , 2004 .

[14]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[15]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[16]  Mostafa Zandieh,et al.  Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach , 2010, Expert Syst. Appl..

[17]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[18]  Chandrasekharan Rajendran,et al.  Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan , 1992 .

[19]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

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

[21]  Kuo-Ching Ying,et al.  Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm , 2012 .

[22]  Gur Mosheiov,et al.  A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time , 2008, Eur. J. Oper. Res..

[23]  Surafel Luleseged Tilahun,et al.  Vector optimisation using fuzzy preference in evolutionary strategy based firefly algorithm , 2013 .

[24]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[25]  T. C. Edwin Cheng,et al.  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..

[26]  Suk Joo Bae,et al.  Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm , 2011, Comput. Ind. Eng..

[27]  Yueh-Min Huang,et al.  Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm , 2008, Expert Syst. Appl..

[28]  Herbert Martins Gomes.  A firefly metaheuristic structural size and shape optimisation with natural frequency constraints , 2012, Int. J. Metaheuristics.

[29]  Suyanto,et al.  Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem , 2011, ICAIS.

[30]  Hema Banati,et al.  Performance analysis of firefly algorithm for data clustering , 2013 .

[31]  Jaehwan Yang,et al.  Minimizing total completion time in two-stage hybrid flow shop with dedicated machines , 2011, Comput. Oper. Res..

[32]  Ming Liu,et al.  A heuristic method for two-stage hybrid flow shop with dedicated machines , 2013, Comput. Oper. Res..

[33]  Haibo Shi,et al.  Multiple rules decision-based DE solution for the earliness-tardiness case of hybrid flow-shop scheduling problem , 2012, Int. J. Model. Identif. Control..

[34]  Shiwei Ma,et al.  A Quantum-Inspired Immune Algorithm for Hybrid Flow Shop with Makespan Criterion , 2009 .

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

[36]  Andrei Tchernykh,et al.  Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers , 2009, Comput. Ind. Eng..

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

[38]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[39]  Dong-Ho Lee,et al.  Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops , 2009, Comput. Ind. Eng..

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

[41]  Ling Wang,et al.  No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm , 2008 .

[42]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

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

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

[45]  Rasoul Shafaei,et al.  Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines , 2011 .

[46]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[47]  Xin-She Yang,et al.  Firefly Algorithm, Lévy Flights and Global Optimization , 2010, SGAI Conf..

[48]  Jacques Teghem,et al.  Scheduling hybrid flow shop problem with non-fixed availability constraints , 2010 .

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

[50]  Hiroshi Morita,et al.  Hybrid Branch and Bound Method with Genetic Algorithm for Flexible Flowshop Scheduling Problem , 2005 .

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

[52]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

[53]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .

[54]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

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

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

[57]  Hui Zhang,et al.  An enhanced firefly algorithm for function optimisation problems , 2013, Int. J. Model. Identif. Control..

[58]  Feng Chu,et al.  Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm , 2009, Int. J. Comput. Integr. Manuf..

[59]  Mohamed Haouari,et al.  Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search , 2011, Comput. Ind. Eng..

[60]  Suna Kondakci Köksalan,et al.  A flexible flowshop problem with total flow time minimization , 2001, Eur. J. Oper. Res..

[61]  V. Selladurai,et al.  Agility in two-stage hybrid flow shop parallel machine scheduling through simulated annealing , 2007 .

[62]  Majid Khalili,et al.  Multi-objective no-wait hybrid flowshop scheduling problem with transportation times , 2012, Int. J. Comput. Sci. Eng..

[63]  S.M.T. Fatemi Ghomi,et al.  Hybrid flowshop scheduling with machine and resource-dependent processing times , 2011 .

[64]  G.-C. Lee,et al.  A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness , 2004 .

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

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

[67]  Mostafa Zandieh,et al.  A simulated annealing/local search to minimize the makespan and total tardiness on a hybrid flowshop , 2013 .