A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

Computers and Operations Research

Volumn 36, Issue 8, 2009, Pages 2498-2511

  Pan, Quan Ke ^a   Wang, Ling ^b   Qian, Bin ^b  

^a LIAOCHENG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Differential evolution; Discrete differential evolution algorithm; Insert neighborhood; Multi objective; No wait flow shop; Speed up

Indexed keywords

ALGORITHMS; BENCHMARKING; DAMPING; LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; MACHINE SHOPS; MULTIOBJECTIVE OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

DIFFERENTIAL EVOLUTION; DISCRETE DIFFERENTIAL EVOLUTION ALGORITHM; INSERT NEIGHBORHOOD; MULTI-OBJECTIVE; NO-WAIT FLOW SHOP; SPEED-UP;

EVOLUTIONARY ALGORITHMS;

EID: 58549115678     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.10.008     Document Type: Article

References (51)

1. Qian B., Wang L., Huang D.X., Wang W.L., and Wang X. An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers & Operations Research 36 1 (2009) 209-233
2. Ishibuchi H., Yoshida I., and Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 7 2 (2003) 204-223
3. Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 45 (1994) 472-478
4. Hall N.G., and Sriskandarayah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 (1996) 510-525
5. Grabowski J., and Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 125 (2003) 535-550
6. Raaymakers W., and Hoogeveen J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research 126 (2000) 131-151
7. Rock H. The three-machine no-wait flowshop problem is NP-complete. Journal of Associate Computer Machinery 31 (1984) 336-345
8. Bonney M.C., and Gundry S.W. Solutions to the constrained flowshop sequencing problem. Operational Research Quarterly 24 (1976) 869-883
9. King J.R., and Spachis A.S. Heuristics for flowshop scheduling. International Journal of Production Research 18 (1980) 343-357
10. Gangadharan R., and Rajedran C. Heuristic algorithms for scheduling in no-wait flowshop. International Journal of Production Economics 32 (1993) 285-290
11. Rajendran C. A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 45 (1994) 472-478
12. Rajendran C., and Chaudhuri D. Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics 37 (1990) 695-705
13. Aldowaisan T., and Allahverdi A. A new heuristics for no-wait flowshops to minimize makespan. Computers & Operations Research 30 (2003) 1219-1231
14. Fink A., and Voß S. Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 151 (2003) 400-414
15. Schuster C.J., and Framinan J.M. Approximate procedure for no-wait job shop scheduling. Operations Research Letters 31 (2003) 308-318
16. Grabowski J., and Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers & Operations Research 32 (2005) 2197-2212
17. Pan Q.K., Wang L., and Zhao B.H. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing Technology 38 7-8 (2008) 778-786
18. Liu B., Wang L., and Jin Y.H. An effective hybrid particle swarm optimization for no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology 31 (2007) 1001-1011
19. Pan Q.K., Tasgetiren M.F., and Liang Y.C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research 35 (2008) 2807-2839
20. Pan Q.K., Wang L., Tasgetirend M.F., and Zhao B.H. A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing Technology 38 (2008) 337-347
21. Daniels R.L., and Chambers R.J. Multiobjective flow-shop scheduling. Naval Research Logistics 37 (1990) 981-995
22. Ravindran D., Noorul Haq A., Selvakuar S.J., and Sivaraman R. Flow shop scheduling with multiple objective of minimizing makespan and total flow time. International Journal of Advanced Manufacturing Technology 25 (2005) 1007-1012
23. T'Kindt V., Monmarche N., Tercinet F., and Laugt D. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research 142 (2002) 250-257
24. Loukil T., Teghem J., and Tuyttens D. Solving multi-objective production scheduling problems using metaheuristics. European Journal of Operational Research 161 (2005) 42-61
25. Deb K., Pratap A., Agarwal S., and Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6 2 (2002) 182-197
26. Arroyo J.E.C., and Armentano V.A. Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research 167 (2005) 717-738
27. Li B.B., and Wang L. A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Transactions on Systems, Man and Cybernetics Part B 37 (2007) 576-591
28. Pasupathy T., Rajendran C., and Suresh R.K. A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. International Journal of Advanced Manufacturing Technology 27 (2006) 804-815
29. Varadharajan T.K., and Rajendran C. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of Jobs. European Journal of Operational Research 167 (2005) 722-795
30. Suresh R.K., and Mohanasundaram K.M. Pareto archived simulated annealing for job shop scheduling with multiple objectives. International Journal of Advanced Manufacturing Technology 29 (2006) 184-196
31. Aliahverdi A., and Aldowaisan T. No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research 152 (2004) 132-147
32. Tavakkoli-Moghaddam R., Rahimi-Vahed A., and Mirzaei A.H. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information Sciences 177 22 (2007) 5072-5090
33. Chen P, Bulfin R. Complexity of multiple machine multicriteria scheduling problems. In: Proceedings of the third IERC, Atlanta, GA; 1994.
34. T'Kindt V, Billaut JC. Multicriteria optimisation theory. In: Multicriteria scheduling: theory, models and algorithms. Berlin, Germany: Springer; 2002.
35. Storn R., and Price K. Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. Journal of Global Optimization 11 (1997) 341-359
36. Ilonen J., Kamarainen J.K., and Lampinen J. Differential evolution training algorithm for feed-forward neural networks. Neural Process Letters 17 (2003) 93-105
37. Ruzek B., and Kvasnicka M. Differential evolution in the earthquake hypocenter location. Pure and Applied Geophysics 158 (2001) 667-693
38. Qian B., Wang L., Hu R., et al. A hybrid differential evolution for permutation flow-shop scheduling. International Journal of Advanced Manufacturing Technology 38 7-8 (2008) 757-777
39. Onwubolu G.C., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 2 (2006) 674-692
40. Tasgetiren MF, Pan QK, Suganthan PN, Liang YC. A discrete differential evolution algorithm for the no-wait flowshop problem with total flowtime criterion. In: Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling; 2007. p. 251-8.
41. Tasgetiren M.F., Sevkli M., Liang Y.C., et al. A particle swarm optimization and differential algorithm for job shop scheduling problem. International Journal of Operations Research 3 (2006) 120-135
42. Nawaz M., Enscore E.E.J., and Ham I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA-International Journal of Management Science 11 (1983) 91-95
43. Wang L. Shop scheduling with genetic algorithms (2003), Tsinghua University Press, Springer, Beijing
44. Schiavinotto T., and Stuzle T. A review of metrics on permutations for search landscape analysis. Computers & Operations Research 34 10 (2007) 3143-3153
45. Silva JDL, Burke EK, Petrovic S. An introduction to multiobjective metaheuristics for scheduling and timetabling. In: Lecture notes in economics and mathematical systems, vol. 535; 2004. p. 91-129.
46. Czyzak P., and Jaszkiewicz A. Pareto-simulated annealing-a meta-heuristic techniques for multi-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis 7 1 (1998) 34-47
47. Knowles JD, Corne DW. On metrics for comparing nondominated sets. In: Proceedings of 2002 congress on evolutionary computation, Honolulu, HI, 12-17 May 2002. p. 711-6.
48. Carlier J. Ordonnancements a contraintes disjonctives. RAIRO-Recherche Operationnelle 12 (1978) 333-351
49. Reeves C. A genetic algorithm for flowshop sequencing. Computers & Operations Research 22 (1995) 5-13
50. Heller J. Some numerical experiments for an M×J flow shop and its decision-theoretical aspects. Operations Research 8 (1960) 178-184
51. Zitzler E., and Thiele L. Multiobjective evolutionary algorithms: a comparison case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3 4 (1999) 257-271