A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Computers and Industrial Engineering

Volumn 55, Issue 4, 2008, Pages 795-816

  Pan, Quan Ke ^a   Tasgetiren, Mehmet Fatih ^b   Liang, Yun Chia ^c  

^a LIAOCHENG UNIVERSITY   (China)

^b SULTAN QABOOS UNIVERSITY   (Oman)

^c YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Discrete differential evolution algorithm; Discrete particle swarm optimization; Iterated greedy algorithm; Permutation flowshop Scheduling; Referenced local search

Indexed keywords

EID: 55449124245     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.03.003     Document Type: Article

References (62)

1. Aldowaisan T., and Allahverdi A. New heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research 20 8 (2003) 1219-1231
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. Andreas N., and Omirou S. Differential evolution for sequencing and scheduling optimization. Journal of Heuristics 12 6 (2006) 395-411
4. 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
5. 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
6. Chen C.-L., Vempati V.S., and Aljaber N. An application of genetic algorithms for flow shop problems. European Journal of Operational Research 80 2 (1995) 389-396
7. Dannenbring D.G. An evaluation of flow shop sequencing heuristics. Management Science 23 11 (1977) 1174-1182
8. Framinan J.M., and Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA 31 (2003) 311-317
9. Framinan J.M., Leisten R., and Ruiz-Usano R. Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization. European Journal of Operational Research 141 (2002) 559-569
10. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers and Operations Research 32 5 (2005) 1237-1254
11. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (1976) 117-129
12. Gelders L.F., and Sambandam N. Four simple heuristics for scheduling a flow-shop. International Journal of Production Research 16 (1978) 221-231
13. 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
14. Gupta J.N.D. Heuristic algorithms for multistage flowshop scheduling problem. AIIE Transactions 4 (1972) 11-18
15. Ho J.C. Flowshop sequencing with mean flow time objective. European Journal of Operational Research 81 (1995) 571-578
16. 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
17. Holm S. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics 6 (1979) 65-70
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. Jacobs L.W., and Brusco M.J. A local search heuristic for large set-covering problems. Naval Research Logistics Quarterly 42 7 (1995) 1129-1140
20. Jarboui B., Ibrahim S., Siarry P., and Rebai A. A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers and Industrial Engineering (2007) 10.1016/j.cie.2007.09.006
21. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation 175 (2006) 773-785
22. Liao C.-J., Tseng C.-T., and Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers and Operations Research 34 10 (2007) 3099-3111
23. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452
24. Marchiori, E., Steenbeek, A. (2000). An evolutionary algorithm for large set covering problems with applications to airline crew scheduling. In Proceedings of the real-world applications of evolutionary computing 2000 (EvoWorkshops 2000), LNCS 1803, Berlin: Springer-Verlag, pp. 367-81.
25. Murata T., Ishibuchi H., and Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering 30 4 (1996) 1061-1071
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. max flowshop problem. Computers and Operations Research 17 3 (1990) 243-253
29. Onwubolu G., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 2 (2006) 674-692
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. Pan, Q. -K., Tasgetiren, M. F., Liang, Y. -C. (2006a). Minimizing total earliness and tardiness penalties with a common due date on a single machine using a discrete particle swarm optimization algorithm. In Proceedings of ant colony optimization and swarm intelligence (ANTS2006), LNCS 4150, Springer-Verlag, pp. 460-67.
33. Pan, Q. -K., Tasgetiren, M. F., Liang, Y. -C. (2006b). A discrete particle swarm optimization algorithm for the permutation flowshop sequencing problem with makespan criterion. In Proceedings of the 26th SGAI international conference on innovative techniques and applications of artificial intelligence (AI-2006), Cambridge, UK, pp. 19-31.
34. Pan, Q. -K., Tasgetiren, M. F., Liang, Y. -C. (2007). A discrete differential evolution algorithm for the permutation flowshop scheduling problem. In Proceedings of the genetic and evolutionary computation conference 2007 (GECCO'07), London, England, UK, pp. 126-33.
35. Pan Q.-K., Tasgetiren M.F., and Liang Y.-C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan and total flowtime criteria. Computers and Operations Research 35 (2008) 2807-2839
36. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics 29 (1993) 65-73
37. 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
38. 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
39. 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
40. Rameshkumar, K., Suresh, R. K., Mohanasundaram, K. M. (2005). Discrete particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. In Proceedings of the ICNC 2005, LNCS 3612 2005, Springer-Verlag, Berlin, pp. 572-81.
41. Reeves C.R. Improving the efficiency of tabu search for machine sequencing problem. Journal of the Operational Research Society 44 4 (1993) 375-382
42. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 1 (1995) 5-13
43. Reeves C.R., and Yamada T. Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation 6 1 (1998) 45-60
44. Rinnooy Kan A.H.G. Machine scheduling problems: Classification, complexity, and computations (1976), The Hague, Nijhoff
45. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 (2005) 479-494
46. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. OMEGA 34 (2006) 461-476
47. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 3 (2007) 2033-2049
48. 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
49. Storn, R., Price, K. (1995). Differential evolution - a simple and efficient adaptive scheme for global optimization over continuous spaces. ICSI, Technical Report TR-95-012.
50. Stützle, T. (1998a). Applying iterated local search to the permutation flowshop problem. Technical Report, AIDA-98-04, FG Intellektik, FB Informatik, TU Darmstadt.
51. Stützle, T. (1998b). An ant approach to the flowshop problem. In Proceedings of the 6th European congress on intelligent techniques and soft computing (EUFIT'98), Verlag Mainz, Aachen, Germany, pp. 1560-4.
52. Taillard E. Some efficient heuristic methods for the flowshop sequencing problems. European Journal of Operational Research 47 (1990) 65-74
53. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
54. Tasgetiren, M. F., Sevkli, M., Liang, Y. -C., Gencyilmaz, G. (2004a). Particle swarm optimization algorithm for permutation flowshop sequencing problem. In Proceedings of ant colony optimization and swarm intelligence (ANTS2004), LNCS 3172, Springer-Verlag, pp. 381-89.
55. Tasgetiren, M. F., Liang, Y. -C., Sevkli, M., Gencyilmaz, G. (2004b). Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion. In Proceedings of the 4th international symposium on intelligent manufacturing systems (IMS2004), Sakarya, Turkey, pp. 442-52.
56. Tasgetiren M.F., Liang Y.-C., Sevkli M., and Gencyilmaz G. Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European Journal of Operational Research 177 3 (2007) 1930-1947
57. Tasgetiren, M. F., Pan, Q. -K., Liang, Y. -C., Suganthan, P.N. (2007b). A discrete differential evolution algorithm for the total earliness and tardiness penalties with a common due date on a single machine. In Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling (CISched2007), Hawaii, USA, pp. 271-78.
58. Tasgetiren, M. F., Pan, Q. -K., Suganthan, P. N., Liang, Y. -C. (2007c). A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion. In Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling (CISched2007), Hawaii, USA, pp. 251-58.
59. i scheduling problems. European Journal of Operational Research 96 (1997) 636-644
60. 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
61. Widmer M., and Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research 41 2 (1989) 186-193
62. 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