A PSO-based hybrid metaheuristic for permutation flowshop scheduling problems

The Scientific World Journal

Volumn 2014, Issue , 2014, Pages

  Zhang, Le ^a,b   Wu, Jinnan ^a  

^a SHENYANG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ACCELERATION; ALGORITHM; ARTICLE; FLOW; HYBRID; PARTICLE SWARM OPTIMIZATION; PERMUTATION FLOWSHOP SCHEDULING PROBLEM; STOCHASTIC MODEL; SYSTEM ANALYSIS; VELOCITY; WEIGHT; THEORETICAL MODEL;

ALGORITHMS; MODELS, THEORETICAL;

EID: 84896866913     PISSN: None     EISSN: 1537744X     Source Type: Journal    
DOI: 10.1155/2014/902950     Document Type: Article

References (37)

1. Johnson S. M., Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954 1 1 61 68 10.1002/nav.3800010110
2. Ruiz R., Maroto C., A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 2005 165 2 479 494 2-s2.0-13444251134 10.1016/j.ejor.2004.04.017
3. Framinan J. M., Leisten R., Ruiz-Usano R., Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers and Operations Research 2005 32 5 1237 1254 2-s2.0-7544243412 10.1016/j.cor.2003.11.002
4. Garey M. R., Johnson D. S., Sethi R., The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1976 1 2 117 129 2-s2.0-0016952078
5. Stafford E. F., On the development of a mixed integer linear programming model for the flowshop sequencing problem. Journal of the Operational Research Society 1988 39 1163 1174
6. Lomnicki Z. A., A branch and bound algorithm for the exact solution of the three machine scheduling problem. Operational Research Quarterly 1965 16 89 100
7. Brown A. P. G., Lomnicki Z. A., Some applications of the branch and bound algorithm to the machine scheduling problem. Operational Research Quarterly 1966 17 173 186
8. McMahon G. B., Burton P. G., Flowshop scheduling with the branch and bound method. Operations Research 1967 15 3 473 481 10.1287/opre.15.3.473
9. Ignall E., Schrage L., Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research 1965 13 3 400 412 10.1287/opre.13.3.400
10. Bansal S. P., Minimizing the sum of completion times of n jobs over m machines in a flowshop-a branch and bound approach. AIIE Transactions 1977 9 3 306 311 10.1080/05695557708975160
11. Chung C.-S., Flynn J., Kirca O., A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. International Journal of Production Economics 2002 79 3 185 196 2-s2.0-0037063769 10.1016/S0925-5273(02)00234-7
12. Campbell H. G., Dudek R. A., Smith M. L., A heuristic algorithm for the n job, m machine sequencing problem. Management Science 1970 16 10 630 637 2-s2.0-0014807274
13. Koulamas C., A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research 1998 105 1 66 71 2-s2.0-0032000804
14. Palmer D., Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Quarterly 1965 16 1 101 107
15. Gupta J. N. D., Heuristic algorithms for multistage flowshop scheduling problem. AIIE Transactions 1972 4 1 11 18 2-s2.0-0015316023
16. Hundal T. S., Rajgopal J., An extension of Palmer's heuristic for the flow shop scheduling problem. International Journal of Production Research 1988 26 6 1119 1124 2-s2.0-0024031629
17. Nawaz M., Enscore E. E. Jr., Ham I., A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 1983 11 1 91 95 2-s2.0-0020699921 10.1016/0305-0483(83)90088-9
18. Taillard E., Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 1990 47 1 65 74 2-s2.0-0025700701
19. Liu J., Reeves C. R., Constructive and composite heuristic solutions to the P// C i scheduling problem. European Journal of Operational Research 2001 132 2 439 452 2-s2.0-0035898985 10.1016/S0377-2217(00)00137-5
20. Framinan J. M., Leisten R., An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega 2003 31 4 311 317 2-s2.0-0037971131 10.1016/S0305-0483(03)00047-1
21. Fan J. P.-O., Winley G. K., A heuristic search algorithm for flow-shop scheduling. Informatica 2008 32 4 453 464 2-s2.0-57349154329
22. Suliman S. M. A., Two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics 2000 64 1 143 152 2-s2.0-0033908223 10.1016/S0925-5273(99)00053-5
23. Framinan J. M., Nagano M. S., Moccellin J. V., An efficient heuristic for total flowtime minimisation in no-wait flowshops. International Journal of Advanced Manufacturing Technology 2010 46 9-12 1049 1057 2-s2.0-77349099464 10.1007/s00170-009-2154-0
24. Chang P. C., Huang W. H., Wu J. L., A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem. International Journal of Production Economics 2013 141 1 45 55 10.1016/j.ijpe.2012.06.007
25. Ruiz R., Maroto C., Alcaraz J., Two new robust genetic algorithms for the flowshop scheduling problem. Omega 2006 34 5 461 476 2-s2.0-30044449841 10.1016/j.omega.2004.12.006
26. Hooda N., Dhingra A. K., Flow shop scheduling using simulated annealing: a review. International Journal of Applied Engineering Research 2011 2 1 234 249
27. Nouri B. V., Fattahi P., Ramezanian R., Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities. International Journal of Production Research 2013 51 12 3501 3515 10.1080/00207543.2012.750771
28. Gao J., Chen R., Deng W., An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research 2013 51 3 641 651 10.1080/00207543.2011.644819
29. Rajendran C., Ziegler H., Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 2004 155 2 426 438 2-s2.0-1642559633 10.1016/S0377-2217(02) 00908-6
30. Ruiz R., Stützle T., A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 2007 177 3 2033 2049 2-s2.0-33750841084 10.1016/j.ejor.2005.12.009
31. Tasgetiren M. F., Liang Y.-C., Sevkli M., Gencyilmaz G., A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 2007 177 3 1930 1947 2-s2.0-33751236810 10.1016/j.ejor.2005.12.024
32. Wang X., Tang L., A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Applied Soft Computing Journal 2012 12 2 652 662 2-s2.0-84655176746 10.1016/j.asoc.2011.09.021
33. Taillard E., Benchmarks for basic scheduling problems. European Journal of Operational Research 1993 64 2 278 285 2-s2.0-0027201278
34. Kennedy J., Eberhart R., Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks December 1995 1942 1948 2-s2.0-0029535737
35. Eberhart R., Kennedy J., New optimizer using particle swarm theory. Proceedings of the 6th International Symposium on Micro Machine and Human Science October 1995 39 43 2-s2.0-0029517385
36. Hansen P., Mladenović N., Variable neighborhood search: principles and applications. European Journal of Operational Research 2001 130 3 449 467 2-s2.0-0034818087 10.1016/S0377-2217(00)00100-4
37. Glover F., Laguna M., Martí R., Fundamentals of scatter search and path relinking. Control and Cybernetics 2000 29 3 652 684 2-s2.0-0347899800