A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

European Journal of Operational Research

Volumn 177, Issue 3, 2007, Pages 1930-1947

  Tasgetiren, M Fatih ^a   Liang, Yun Chia ^b   Sevkli, Mehmet ^a   Gencyilmaz, Gunes ^c  

^a FATIH UNIVERSITY   (Turkey)

^b YUAN ZE UNIVERSITY   (Taiwan)

^c ISTANBUL KULTUR UNIVERSITY   (Turkey)

Author keywords

Makespan; Particle swarm optimization; Permutation flowshop; Scheduling; Total flowtime; Variable neighborhood search

Indexed keywords

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

MAKESPAN; PARTICLE SWARM OPTIMIZATION; PERMUTATION FLOWSHOP; TOTAL FLOWTIME; VARIABLE NEIGHBORHOOD SEARCH;

OPERATIONS RESEARCH;

EID: 33751236810     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.12.024     Document Type: Article

References (58)

1. Abido M.A. Optimal power flow using particle swarm optimization. Electrical Power and Energy Systems 24 (2002) 563-571
2. Allahverdi A., and Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 77 (2002) 71-83
3. 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 9 (1977) 306-311
4. Bean J.C. Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6 2 (1994) 154-160
5. Brandstatter B., and Baumgartner U. Particle swarm optimization - mass-spring system analogon. IEEE Transactions on Magnetics 38 (2002) 997-1000
6. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n job, m machine sequencing problem. Management Science 16 10 (1970) B630-B637
7. Dannenbring D.G. An evaluation of flow shop sequencing heuristics. Management Science 23 11 (1977) 1174-1182
8. R.C. Eberhard, J. Kennedy, A new optimizer using particle swarm theory, in: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, pp. 39-43.
9. Framinan J.M., and Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA 31 (2003) 311-317
10. Framinan J.M., Leisten R., and Ruiz-Usano R. Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. European Journal of Operational Research 141 (2002) 559-569
11. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimization in permutation flowshops. Computers and Operations Research 32 5 (2005) 1237-1254
12. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (1976) 117-129
13. Gelders L.F., and Sambandam N. Four simple heuristics for scheduling a flow-shop. International Journal of Production Research 16 (1978) 221-231
14. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion. Computers and Operations Research 31 11 (2004) 1891-1909
15. Gupta J.N.D. Heuristic algorithms for multistage flowshop scheduling problem. AIIE Transactions 4 (1972) 11-18
16. Ho J.C. Flowshop sequencing with mean flow time objective. European Journal of Operational Research 81 (1995) 571-578
17. Ho J.C., and Chang Y.-L. A new heuristic for the n-job, M-machine flowshop problem. European Journal of Operational Research 52 (1991) 194-202
18. Ignall E., and Schrage L. Application of the branch-and-bound technique to some flowshop scheduling problems. Operations Research 13 (1965) 400-412
19. Johnson S.M. Optimal two-and three-stage production schedules. Naval Research Logistics Quarterly 1 (1954) 61-68
20. J. Kennedy, R.C. Eberhard, Particle swarm optimization, in: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, USA, 1995, pp. 1942-1948.
21. Kennedy J., Eberhart R.C., and Shi Y. Swarm Intelligence (2001), Morgan Kaufmann, San Mateo, CA, USA
22. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452
23. Miyazaki S., and Nishiyama N. Analysis for minimizing weighted mean flowtime in flowshop scheduling. Journal of the Operations Research Society of Japan 23 (1980) 118-132
24. Miyazaki S., Nishiyama N., and Hashimoto F. An adjacent pairwise approach to the mean flowtime scheduling problem. Journal of the Operations Research Society of Japan 21 (1978) 287-299
25. Mladenovic N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100
26. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA 11 1 (1983) 91-95
27. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flowshop problem. European Journal of Operational Research 91 (1996) 160-175
28. Ogbu F., and Smith D. The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. Computers and Operations Research 17 3 (1990) 243-253
29. Onwubolu G.C., and Clerc M. Optimal operating path for automated drilling operations by a new heuristic approach using particle swarm optimisation. International Journal of Production Research 42 3 (2004) 473-491
30. Osman I., and Potts C. Simulated annealing for permutation flow shop scheduling. OMEGA 17 6 (1989) 551-557
31. Palmer D.S. Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum. Operational Research Quarterly 16 (1965) 101-107
32. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics 29 (1993) 65-73
33. Rajendran C. A heuristics for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research 32 (1994) 2541-2558
34. Rajendran C., and Chaudhuri D. A flowshop scheduling algorithm to minimize total flowtime. Journal of the Operations Research Society of Japan 34 (1991) 28-45
35. Rajendran C., and Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research 61 (1991) 318-325
36. Rajendran C., and Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research 103 (1997) 129-138
37. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 2 (2004) 426-438
38. Reeves C. Improving the efficiency of tabu search for machine sequencing problem. Journal of the Operational Research Society 44 4 (1993) 375-382
39. Reeves C. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 1 (1995) 5-13
40. Reeves C., and Yamada T. Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation 6 (1998) 45-60
41. Rinnooy Kan A.H.G. Machine Scheduling Problems: Classification, Complexity, and Computations (1976), Nijhoff, The Hague
42. Salman A., Ahmad I., and Al-Madani S. Particle swarm optimization for tast assignment problem. Microprocessors and Microsystems 26 (2003) 363-371
43. Stafford E.F. On the development of a mixed integer linear programming model for the flowshop sequencing problem. Journal of Operational Research Society 39 (1988) 1163-1174
44. T. Stützle, 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, 1998.
45. Stützle T. An ant approach to the flowshop problem. Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT'98) (1998), Verlag Mainz, Aachen, Germany 1560-1564
46. Taillard E. Some efficient heuristic methods for the flowshop sequencing problems. European Journal of Operational Research 47 (1990) 65-74
47. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
48. Tasgetiren M.F., and Liang Y.-C. A binary particle swarm optimization algorithm for lot sizing problem. Journal of Economic and Social Research 5 2 (2003) 1-20
49. M.F. Tasgetiren, Y.-C. Liang, M. Sevkli, G. Gencyilmaz, Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem, in: Proceedings of the 4th International Symposium on Intelligent Manufacturing Systems (IMS2004), Sakarya, Turkey, 2004, pp. 431-441.
50. M.F. Tasgetiren, M. Sevkli, Y.-C. Liang, G. Gencyilmaz, Particle swarm optimization algorithm for single machine total weighted tardiness problem, in: Proceedings of the 2004 Congress on Evolutionary Computation (CEC'04), Portland, Oregon, 2004, pp. 1412-1419.
51. Tasgetiren M.F., Sevkli M., Liang Y.C., and Gencyilmaz G. Particle swarm optimization algorithm for permutation flowshop sequencing problem. Lecture Notes in Computer Science vol. 3172 (2004), Springer-Verlag pp. 382-390
52. Van den Bergh F., and Engelbecht A.P. Cooperative learning in neural networks using particle swarm optimizers. South African Computer Journal 26 (2000) 84-90
53. i scheduling problems. European Journal of Operational Research 96 (1997) 636-644
54. Watson J.P., Barbulescu L., Whitley L.D., and Howe A.E. Contrasting structured and random permutation flowshop scheduling problems: Search space topology and algorithm performance. ORSA Journal of Computing 14 2 (2002) 98-123
55. Woo D.S., and Yim H.S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research 25 (1998) 175-182
56. max permutation flowshop scheduling problem by genetic local search, in: Proceedings of 1998 IEEE International Conference on Evolutionary Computation, 1998, pp. 230-234.
57. L.-W. Yeh, Optimal Procurement Policies for Multi-product Multi-supplier with Capacity Constraint and Price Discount, Master thesis, Department of Industrial Engineering and Management, Yuan Ze University, Taiwan, ROC, 2003.
58. Yoshida H., Kawata K., Fukuyama Y., and Nakanishi Y. A particle swarm optimization for reactive power and voltage control considering voltage security assessment. IEEE Transactions on Power Systems 15 (2000) 1232-1239