A hybrid fruit fly optimisation algorithm to solve the flow shop scheduling problems with multi-objectives

Scheduling is one of the most important decision making processes in production and operations management. Different scheduling environments are addressed by the researchers in the literature. In this paper, flow shop scheduling problems are studied. Many researchers tackled with single objective flow shop scheduling problems with makespan objective only. However, scheduling problems consist of many conflict objectives. Hence, in this paper an attempt is made to solve the multi-objective flow shop scheduling problems. The objective is to minimise the weighted sum of makespan, mean flow time, earliness and tardiness. The flow shop scheduling problems have been proved to be NP-hard. Hence, the problems cannot be solved by the exact algorithms. In this paper, a relatively new meta-heuristic algorithm called as hybrid fruit fly optimisation algorithm is proposed to solve the multi-objective flow shop scheduling problems. Two constructive heuristics and a dispatching rule are incorporated with the fruit fly optimisation algorithm and hence the solution quality is improved. The proposed algorithm is tested on random problem instances and the results are compared with many other meta-heuristic algorithms. The results show that the proposed algorithm is more effective and better than other meta-heuristic algorithms.

[1]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[2]  Wen-Tsao Pan,et al.  A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example , 2012, Knowl. Based Syst..

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

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

[5]  Subhash C. Sarin,et al.  Scheduling heuristic for the n-jobm-machine flow shop , 1993 .

[6]  Shengyao Wang,et al.  A novel fruit fly optimization algorithm for the semiconductor final testing scheduling problem , 2014, Knowl. Based Syst..

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

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

[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]  Liang Gao,et al.  Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects , 2011 .

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

[12]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

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

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

[15]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[16]  Jayant Rajgopal,et al.  An extension of Palmer's heuristic for the flow shop scheduling problem , 1988 .

[17]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[18]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

[19]  J. R. Shah,et al.  Performance of priority rules in a due date flow shop , 1992 .

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

[21]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[22]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[23]  Liu Cheng-zhong.  Fruit fly optimization algorithm with adaptive mutation , 2013 .

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

[25]  Serpil Sayin,et al.  A bicriteria approach to the two-machine flow shop scheduling problem , 1999, Eur. J. Oper. Res..

[26]  C. Rajendran,et al.  A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs , 2006 .

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

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

[29]  Victor Fernandez-Viagas,et al.  A new set of high-performing heuristics to minimise flowtime in permutation flowshops , 2015, Comput. Oper. Res..

[30]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

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

[32]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

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

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

[35]  Sen Guo,et al.  A hybrid annual power load forecasting model based on generalized regression neural network with fruit fly optimization algorithm , 2013, Knowl. Based Syst..

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

[37]  J. Carlier,et al.  Two branch and bound algorithms for the permutation flow shop problem , 1996 .

[38]  Chris N. Potts,et al.  An adaptive branching rule for the permutation flow-shop problem , 1980 .

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

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

[41]  Godfrey C. Onwubolu,et al.  Genetic algorithm for minimizing tardiness in flow-shop scheduling , 1999 .

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

[43]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

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

[45]  Wei-Yuan Lin,et al.  Using Fruit Fly Optimization Algorithm Optimized Grey Model Neural Network to Perform Satisfaction Analysis for E-Business Service , 2013 .

[46]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[47]  Chinyao Low,et al.  A robust simulated annealing heuristic for flow shop scheduling problems , 2004 .

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

[49]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[50]  Liu Cheng-zhong,et al.  Adaptive chaos fruit fly optimization algorithm , 2013 .

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

[52]  Quan-Ke Pan,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[53]  Chris N. Potts,et al.  A New Heuristic for Three-Machine Flow Shop Scheduling , 1996, Oper. Res..

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

[55]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

[56]  Yeong-Dae Kim.  Minimizing total tardiness in permutation flowshops , 1995 .

[57]  Huiru Zhao,et al.  Annual Electric Load Forecasting by a Least Squares Support Vector Machine with a Fruit Fly Optimization Algorithm , 2012 .

[58]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[59]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

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

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

[62]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..

[63]  Johnny C. Ho,et al.  Flowshop sequencing with mean flowtime objective , 1995 .

[64]  Yi Pan,et al.  An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model , 2009, Expert Syst. Appl..

[65]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

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

[67]  A. Rahimi-Vahed,et al.  A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem , 2009 .

[68]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

[69]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[70]  John M. Wilson,et al.  A genetic algorithm for flow shop scheduling problems , 2004, J. Oper. Res. Soc..

[71]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

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

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

[74]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[75]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[76]  Kenji Itoh,et al.  A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem , 1995 .

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

[78]  Wang Sheng,et al.  Fruit fly optimization algorithm based fractional order fuzzy-PID controller for electronic throttle , 2013 .

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

[80]  D. Ravindran,et al.  Flow shop scheduling with multiple objective of minimizing makespan and total flow time , 2005 .

[81]  Ömür Tosun,et al.  Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion , 2014, Int. J. Math. Model. Numer. Optimisation.

[82]  Ashour Said.  A Branch-and-Bound Algorithm for Flow Shop Scheduling Problems , 1970 .

[83]  Qian He,et al.  On a novel multi-swarm fruit fly optimization algorithm and its application , 2014, Appl. Math. Comput..

[84]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[85]  Umi Kalthum Ngah,et al.  A simulation based fly optimisation algorithm for swarms of mini autonomous surface vehicles application , 2011 .

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

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

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

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

[90]  R. L. Daniels,et al.  Multiobjective flow-shop scheduling , 1990 .

[91]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total tardiness for m , 2006, Eur. J. Oper. Res..

[92]  Jianhua Lu,et al.  Optimization about the layout of IMUs in large ship based on fruit fly optimization algorithm , 2015 .

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

[94]  Shengyao Wang,et al.  A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem , 2013, Knowl. Based Syst..

[95]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers , 2009, Comput. Oper. Res..

[96]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .

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

[98]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .