Minimizing Makespan Using Node Based Coincidence Algorithm in the Permutation Flowshop Scheduling Problem

This paper proposes a Node-Based Coincidence Algorithm (NB-COIN) for the permutation flowshop scheduling problems (PFSP) aimed at Makespan minimization. For almost half a century, a variety of complex algorithms have been introduced to solve the problems. Nevertheless, these algorithms will be useless if they fail to implement in practice where computational time and complexity of algorithm become an important issue of concern. NB-COIN is proved to be an effective algorithm and it is extremely fast. Based on the bench-mark data sets of Taillard, the presented algorithm provides acceptable solutions within a very short period of time. More importantly, the results generated by NB-COIN are also better than other well-known algorithms in consideration.

[1]  Ling Wang,et al.  A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation , 2014 .

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

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

[4]  Shih-Wei Lin,et al.  Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm , 2013 .

[5]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[6]  Mircea ANCĂU,et al.  ON SOLVING FLOWSHOP SCHEDULING PROBLEMS , 2012 .

[7]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

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

[9]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[10]  Prabhas Chongstitvatana,et al.  Application of Node Based Coincidence algorithm for flow shop scheduling problems , 2013, The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE).

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

[12]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[13]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[14]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..

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

[16]  Thomas Sttzle,et al.  Applying iterated local search to the permutation ow shop problem , 1998 .

[17]  Liang Gao,et al.  A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem , 2011, Expert Syst. Appl..

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

[19]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

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

[21]  Prabhas Chongstitvatana,et al.  Solving Sudoku puzzles with node based Coincidence algorithm , 2013, The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE).

[22]  Orhan Engin,et al.  Using ant colony optimization to solve hybrid flow shop scheduling problems , 2007 .

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

[24]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

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

[26]  Chen Fang,et al.  An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem , 2012, Comput. Oper. Res..

[27]  Prabhas Chongstitvatana,et al.  The effectiveness of hybrid negative correlation learning in evolutionary algorithm for combinatorial optimization problems , 2011, 2011 IEEE International Conference on Industrial Engineering and Engineering Management.

[28]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[30]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[31]  Prabhas Chongstitvatana,et al.  Multi-objective Combinatorial Optimisation with Coincidence algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[32]  Parames Chutima,et al.  A multi-objective coincidence memetic algorithm for a mixed-model U-line sequencing problem , 2010, Int. J. Adv. Oper. Manag..

[33]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[34]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[35]  F. Ahmadizar,et al.  Solving permutation flow shop sequencing using ant colony optimization , 2007, 2007 IEEE International Conference on Industrial Engineering and Engineering Management.

[36]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[37]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[38]  Prabhas Chongstitvatana,et al.  Application of node based estimation of distribution algorithms for solving order acceptance with capacity balancing problems by trading off between over capacity and under capacity utilization , 2014, 2014 International Computer Science and Engineering Conference (ICSEC).

[39]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

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

[41]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

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

[43]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[44]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

[45]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[46]  R ReevesColin.  A genetic algorithm for flowshop sequencing , 1995 .

[47]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

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

[49]  Shigeyoshi Tsutsui,et al.  Node Histogram vs. Edge Histogram: A Comparison of Probabilistic Model-Building Genetic Algorithms in Permutation Domains , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[50]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[51]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[52]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[53]  Scott Turner,et al.  Comparison of heuristics for flow shop sequencing , 1987 .