A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem

International Journal of Production Research

Volumn 51, Issue 16, 2013, Pages 4732-4754

  Li, Xiangtao ^a,b   Yin, Minghao ^a,b  

^a NORTHEAST NORMAL UNIVERSITY   (China)

^b JILIN UNIVERSITY   (China)

Author keywords

cuckoo search; differential evolution; local search; memetic algorithm; particle swarm optimisation; permutation flow shop scheduling

Indexed keywords

CUCKOO SEARCHES; DIFFERENTIAL EVOLUTION; LOCAL SEARCH; MEMETIC ALGORITHMS; PARTICLE SWARM OPTIMISATION; PERMUTATION FLOW-SHOP SCHEDULING;

COMPUTATIONAL COMPLEXITY; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING;

MACHINE SHOP PRACTICE;

EID: 84882454372     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2013.767988     Document Type: Article

References (51)

1. Bansal, S. P. 1977. Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop-a Branch and Bound Approach. A I I E Transactions, 9: 306-311.
2. Bassem, J., and, Eddaly, M. 2009. An Estimation of Distribution Algorithm for Minimizing the Total Flowtime in Permutation Flowshop Scheduling Problems. Computer &Operations Research, 36: 2638-2646.
3. Bean, J. C. 1994. Genetic Algorithms and Random Keys for Sequencing and Optimization. INFORMS Journal on Computing, 6: 154-160.
4. Campbell, H. G., Dudek, R. A., and, Smith, M. L. 1970. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem. Management Science, 16: 630-637.
5. Carlier, J. 1978. Ordonnancements a Contraintes Disjonctives, R.A.I.R.O. Recherche Operationelle/Oper, 12: 333-351.
6. Croce, F. D., and, Tadei Ghirardi, M. R. 2002. An Improved Branch-and-Bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem. European Journal of Operational Research, 139: 293-301.
7. Demirkol, E., Mehta, S., and, Uzsoy, R. 1998. Benchmarks for Shop Scheduling Problems. European Journal of Operational Research, 109: 137-141.
8. Dipak, L., Uday, K., and, Chakraborty. 2007. An Efficient Stochastic Hybrid Heuristic for Flowshop Scheduling. Engineering Application of Artificial Intelligence, 20: 851-856.
9. Dong, X. Y., and, Huang, H. K. 2009. An Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime Criterion. Computers & Operations Research, 36: 1664-1669.
10. Framinan, J. M., and, Leisten, R. 2003. An Efficient Constructive Heuristic for Flowtime Minimisation in Permutation Flow Shops. OMEGA, 31: 311-317.
11. Garey, M. R., and, Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, CA: Freeman.
12. Grabowski, J., and, Wodecki, M. 2004. A Very Fast Tabu Search Algorithm for the Permutation Flow Shop Problem with Makespan Criterion. Computers & Operations Research, 31: 1891-1909.
13. Ignall, E., and, Schrage, L. 1965. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems. Operations Research, 13: 400-412.
14. Johnson, S. M. 1954. Optimal Two-and Three-Stage Production Schedules with Setup Times Included. Naval Research Logistics Quarterly, 1: 61-68.
15. Kalczynski, P. J., and, Kamburowski, J. 2007. On No-Wait and No-Idle Flow Shops with Makespan Criterion. European Journal of Operational Research, 178 (3): 677-685.
16. Liang, J. J., Pan, Q. K., Chen, T. J., and, Wang, L. 2011. Solving the Blocking Flow Shop Scheduling Problem by a Dynamic Multi-Swarm Particle Swarm Optimizer. The International Journal of Advanced Manufacturing Technology, 55 (5-8): 755-762.
17. Liu, J., and, Reeves, C. R. 2001. Constructive and Composite Heuristic Solutions to the P//Ci Scheduling Problem. European Journal of Operational Research, 132: 439-452.
18. Liu, B., and, Wang, L. 2007. An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling. IEEE Transaction Systems, Man, Cybernetics-Part B, 37: 18-27.
19. Low, C. Y., Yeh, J. Y., and, Huang, K. I. 2004. A Robust Simulated Annealing Heuristic for Flow Shop Scheduling Problems. The International Journal of Advanced Manufacturing Technology, 23: 762-767.
20. Murata, T., Ishibuchi, H., and, Tanaka, H. 1996. Genetic Algorithms for Flowshop Scheduling Problems. Computers and Operations Research, 30: 1061-1071.
21. Nagano, M. S., and, Moccellin, J. V. 2002. A High Quality Solution Constructive Heuristic for Flow Shop Sequencing. Journal of the Operational Research Society, 53 (12): 1374-1379.
22. Nagano, M. S., and, Moccellin, J. V. 2008. Reducing Mean Flow Time in Permutation Flow Shop. Journal of the Operational Research Society, 59 (7): 939-945.
23. Nawaz, M. 1983. A Heuristic Algorithm for the m-machine, n-job Flow-Shop Sequencing Problem. Omega, 11: 91-95.
24. Nearchou, A. C. 2004. A Novel Metaheuristic Approach for the Flow Shop Scheduling Problem. Engineering Applications of Artificial Intelligence, 17: 289-300.
25. Nowicki, E., and, Smutnicki, C. 1996. A Fast Tabu Search Algorithm for the Permutation Flow-Shop Problem. European Journal of Operational Research, 91: 160-175.
26. Pan, Q. K. 2011. An Effective Shuffled Frog-Leaping Algorithm for Lot-Streaming Flow Shop Scheduling Problem. The International Journal of Advanced Manufacturing Technology, 52 (5-8): 699-713.
27. Qian, B., and, Wang, L. 2008. A Hybrid Differential Evolution Method for Permutation Flow-Shop Scheduling. The International Journal of Advanced Manufacturing Technology, 38: 757-777.
28. Rajendran, C. 1994. A Heuristic for Scheduling in Flowshop and Flowline-Based Manufacturing Cell with Multi-Criteria. International Journal of Production Research, 32: 2541-2558.
29. Rajendran, C., and, Ziegler, H. 2004. Ant-Colony Algorithms for Permutation Flowshop Scheduling to Minimize Makespan/Total Flowtime of Jobs. European Journal of Operational Research, 155: 426-438.
30. Reeves, C. 1995. A Genetic Algorithm for Flowshop Sequencing. Computers & Operations Research, 22: 5-13.
31. Reeves, C., and, Yamada, T. 1998. Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem. Evolutionary Computation, 6: 45-60.
32. Revees, C. 1993. Improving the Efficiency of Tabu Search for Machine Sequencing Problem. Journal of Operational Research Society, 44: 375-382.
33. Rinnooy Kan, A. H. G. 1976. Machine Scheduling Problems: Classification, Complexity, and Computations. Nijhoff: The Hague.
34. Stadtler, H. 2005. Supply Chain Management and Advanced Planning-Basics, Overview and Challenges. European Journal of Operational Research, 163: 575-588.
35. Stafford, E. F. 1988. On the Development of a Mixed Integer Linear Programming Model for the Flowshop Sequencing Problem. Journal of the Operational Research Society, 39: 1163-1174.
36. Stützle, T. 1998. "An Ant Approach to the Flowshop Problem." In Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT98), Aachen, Germany: Verlag Mainz. 1560-1564
37. Stützle, T. 1998. Applying Iterated Local Search to the Permutation Flowshop Problem, Technical Report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intellctics Group, Darmstad, Germany.
38. Taillard, E. 1990. Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem. European Journal of Operational Research, 47: 65-74.
39. Taillard, E. 1993. Benchmarks for Basic Scheduling Problems. European Journal of Operational Research, 64: 278-285.
40. Tasgetiren, M. F., Y. C. Liang, M. Sevkli, G. Gencyilmaz. 2004. "Particle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem." In Proceedings of the Fourth International Symposium on Intelligent Manufacturing Systems. (431-441). Turkey: Sakarya.
41. Tasgetiren, M. F., Liang, Y. C., Sevkli, M., and, Gencyilmaz, G. 2007. A Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in the Permutation Flowshop Sequencing Problem. European Journal of Operational Research, 177: 1930-1947.
42. Tasgetiren, M. F., Pan, Q. K., Suganthan, P. N., and, Chua, T. J. 2010. A Differential Evolution Algorithm for the No-idle Flowshop Scheduling Problem with Total Tardiness Criterion. International Journal of Production Research, 45 (16): 5033-5050.
43. Tseng, L. Y., and, Lin, Y. T. 2009. A Hybrid Genetic Local Search Algorithm for the Permutation Flowshop Scheduling Problem. European Journal of Operational Research, 198: 84-92.
44. Wang, L., and D. Z. Zheng. 2003. "An Effective Hybrid Heuristic for Flow Shop Scheduling." The International Journal of Advanced Manufacturing Technology 21, 38-44.
45. Wang, L., Pan, Q. K., and, Tasgetiren, M. F. 2011. A Hybrid Harmony Search Algorithm for the Blocking Permutation Flow Shop Scheduling Problem. Computers & Industrial Engineering, 61 (1): 76-83.
46. Yang, X. S., and, Deb, S. 2010. Engineering Optimisation by Cuckoo Search. International Journal of Mathematical Modelling and Numerical Optimisation, 1 (4): 330-343.
47. Yang, X. S., and S. Deb. 2009. Cuckoo Search Via Lévy Flights, In Proc. of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), December 2009, (210-214). IEEE Publication, USA: India.
48. Zhang, C., and, Sun, J. 2009. An Alternate Two Phases Particle Swarm Optimization Algorithm for Flow Shop Scheduling Problem. Expert Systems with Applications, 36: 5162-5167.
49. Zhang, J. D., and, Zhang, C. S. 2010. The Circular Discrete Particle Swarm Optimization Algorithm for Flow Shop Scheduling Problem. Expert Systems with Applications, 37: 5827-5834.
50. zhang, Y., Li, X. P., and, Wang, Q. 2009. Hybrid Genetic Algorithm for Permutation Flowshop Scheduling Problems with Total Flowtime Minimization. European Journal of Operational Research, 196: 869-876.
51. Zheng, T. M., and, Yamashiro, M. S. 2010. Solving Flow Shop Scheduling Problems by Quantum Differential Evolutionary Algorithm. The International Journal of Advanced Manufacturing Technology, 49 (5-8): 643-662.