Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time

Display Omitted An attempt is made to solve the NP-hard type combinatorial problems using monkey search algorithm.Algorithm is validated using the benchmark problems addressed in the literature.Results proved the effectiveness of the proposed algorithm. This paper addresses a sub-population based hybrid monkey search algorithm to solve the flow shop scheduling problem which has been proved to be non-deterministic polynomial time hard (NP-hard) type combinatorial optimization problems. Minimization of makespan and total flow time are the objective functions considered. In the proposed algorithm, two different sub-populations for the two objectives are generated and different dispatching rules are used to improve the solution quality. To the best of our knowledge, this is the first application of monkey search algorithm to solve the flow shop scheduling problems. The performance of the proposed algorithm has been tested with the benchmark problems addressed in the literature. Computational results reveal that the proposed algorithm outperforms many other heuristics and meta-heuristics addressed in the literature.

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

[2]  Hongnan Li,et al.  A modified monkey algorithm for optimal sensor placement in structural health monitoring , 2012 .

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

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

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

[6]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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

[8]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

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

[10]  Sun Ji-zhou,et al.  Intrusion Detection Technology Based on Monkey Algorithm , 2011 .

[11]  Wansheng Tang,et al.  Monkey Algorithm for Global Numerical Optimization , 2008 .

[12]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

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

[14]  B. L. Shivakumar,et al.  ENHANCED BACTERIAL FORAGING ALGORITHM FOR PERMUTATION FLOW SHOP SCHEDULING PROBLEMS , 2013 .

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

[16]  Ping Chen,et al.  A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time , 2013, Comput. Oper. Res..

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

[18]  Marco César Goldbarg,et al.  New VNS heuristic for total flowtime flowshop scheduling problem , 2012, Expert Syst. Appl..

[19]  Liang Zheng,et al.  An improved monkey algorithm with dynamic adaptation , 2013, Appl. Math. Comput..

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

[21]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[22]  A. Noorul Haq,et al.  Performance evaluation of the scatter search method for permutation flowshop sequencing problems , 2008 .

[23]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

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

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

[26]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

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

[28]  Lin-Yu Tseng,et al.  A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .

[29]  Xin Chen,et al.  An improved monkey algorithm for a 0-1 knapsack problem , 2016, Appl. Soft Comput..

[30]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

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

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

[33]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[34]  Quan-Ke Pan,et al.  Local search methods for the flowshop scheduling problem with flowtime minimization , 2012, Eur. J. Oper. Res..

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

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

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

[38]  Ö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.

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

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

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

[42]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[43]  Yixin Yu,et al.  Discrete monkey algorithm and its application in transmission network expansion planning , 2010, IEEE PES General Meeting.

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

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

[46]  P. Shahabudeen,et al.  An improved genetic algorithm for the flowshop scheduling problem , 2009 .