An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers

Computers and Operations Research

Volumn 36, Issue 1, 2009, Pages 209-233

  Qian, Bin ^a,b   Wang, Ling ^a   Huang, De xian ^a   Wang, Wan liang ^c   Wang, Xiong ^a  

^a TSINGHUA UNIVERSITY   (China)

^b KUNMING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Differential evolution; Exploration and exploitation; Hybrid algorithm; Limited buffers; Local search; Multi objective flow shop scheduling

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; MACHINE SHOP PRACTICE; MARKOV PROCESSES; MATHEMATICAL TRANSFORMATIONS; MULTIOBJECTIVE OPTIMIZATION; NATURAL RESOURCES EXPLORATION; NUCLEAR PROPULSION; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS; SOLUTIONS; TECHNOLOGY;

(E ,2E) THEORY; APPLIED (CO); COMBINATORIAL OPTIMIZATION PROBLEMS; CONVERGENCE PROPERTIES; DIFFERENTIAL EVOLUTION (DE); ELSEVIER (CO); FINITE MARKOV CHAINS; FLOW SHOP SCHEDULING; GLOBAL SEARCH; HYBRID ALGORITHM (HA); LIMITED BUFFERS; LOCAL SEARCH (LS); MULTI OBJECTIVE OPTIMIZATION (MOP); MULTI OBJECTIVES; NP-HARD; PARALLEL EVOLUTION; PERMUTATION FLOW-SHOP SCHEDULING; SCHEDULING PROBLEMS; SOLUTION SPACES; SUB-REGIONS;

EVOLUTIONARY ALGORITHMS;

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

References (68)

1. Wang L. Shop scheduling with genetic algorithms (2003), Tsinghua University Press, Springer, Beijing
2. Nawaz M., Enscore E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 (1983) 91-95
3. Wang L., Zhang L., and Zheng D.Z. A class of order-based genetic algorithm for flow shop scheduling. International Journal of Advanced Manufacture Technology 22 11-12 (2003) 828-835
4. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91 (1996) 160-175
5. Wang L., and Zheng D. An effective hybrid heuristic for flow shop scheduling. International Journal of Advanced Manufacture Technology 21 (2003) 38-44
6. Grabowski J., and Pempera J. New block properties for the permutation flowshop problem with application in tabu search. Journal of the Operational Research Society 52 (2001) 210-220
7. Hall N.G., and Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 (1996) 510-525
8. Ronconi D.P. A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Annals of Operations Research 138 1 (2005) 53-65
9. Grabowski J., Skubalska E., and Smutnicki C. On flow shop scheduling with release and due dates to minimize maximum lateness. Journal of Operational Research Society 34 (1983) 615-620
10. Smutnicki C. Block approach for flow-shop scheduling with storage constraints. Zeszyty Naukowe Politechniki Slaskiej Ser Automatyka 84 (1986) 223-233
11. Smutnicki C. A two-machine permutation flow shop scheduling problem with buffers. OR Spectrum 20 4 (1998) 229-235
12. Nowicki E. The permutation flow shop with buffers: a tabu search approach. European Journal of Operational Research 116 (1999) 205-219
13. Papadimitriou C.H., and Kanellakis P.C. Flow shop scheduling with limited temporary storage. Journal of the Association for Computing Machinery 27 (1980) 533-549
14. Leisten R. Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 28 (1990) 2085-2100
15. Brucker P., Heitmann S., and Hurink J. Flow-shop problems with intermediate buffers. OR Spectrum 25 4 (2003) 549-574
16. Wang L., Zhang L., and Zheng D.Z. An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Computers & Operations Research 33 (2006) 2960-2971
17. Norman B.A. Scheduling flowshops with finite buffers and sequence-dependent setup times. Computers & Industrial Engineering 36 1 (1999) 163-177
18. Soukhal A., Oulamara A., and Martineau P. Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research 161 1 (2005) 32-41
19. Sikora R. A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Computers & Industrial Engineering 30 4 (1996) 969-981
20. Wardono B., and Fathi Y. A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. European Journal of Operational Research 155 2 (2004) 380-401
21. Grabowski J., and Pempera J. The permutation flow shop problem with blocking. A tabu search approach. Omega 35 (2007) 302-311
22. Weng M.X. Scheduling flowshops with limited buffer spaces. Proceedings of the Winter Simulation Conference (2000) 1359-1363
23. Gourgand M., Grangeon N., and Norre S. Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity. European Journal of Operational Research 161 1 (2005) 126-147
24. Agnetis A., Rossi F., and Gristina G. An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer. Naval Research Logistics 45 2 (1998) 141-164
25. Pranzo M. Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. European Journal of Operational Research 153 3 (2004) 581-592
26. Sawik T. An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Mathematical and Computer Modelling 36 4-5 (2002) 461-471
27. Daniels R.L., and Chambers R.J. Multiobjective flow-shop scheduling. Naval Research Logistics 37 (1990) 981-995
28. Bagchi T.P. Multiobjective scheduling by genetic algorithms (1999), Kluwer Academic Publishers, Boston
29. Srinivas N., and Deb K. Multiobjective function optimization using nondominated sorting genetic algorithms. Evolutionary Computation 2 3 (1995) 221-248
30. Ponnambalam S.G., Jagannathan H., Kataria M., and Gadicheria A. A TSP-GA multi-objective algorithm for flow-shop scheduling. International Journal of Advanced Manufacturing Technology 23 11-12 (2004) 909-915
31. Loukil T., Teghem J., and Tuyttens D. Solving multi-objective production scheduling problems using metaheuristics. European Journal of Operational Research 161 (2005) 42-61
32. Ishibuchi H., and Murata T. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems Man and Cybernetics Part C 28 (1998) 392-403
33. Ishibuchi H., Yoshida T., and Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 7 (2003) 204-223
34. Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization. European Journal of Operational Research 137 1 (2002) 50-71
35. 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
36. Deva Prasad S., Rajendran C., and Krishnaiah Chetty O.V. A genetic algorithmic approach to multi-objective scheduling in a Kanban-controlled flowshop with intermediate buffer and transport constraints. International Journal of Advanced Manufacturing Technology 29 5 (2006) 564-576
37. Storn R., and Price K. Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11 4 (1997) 341-359
38. Ilonen J., Kamarainen J.K., and Lampinen J. Differential evolution training algorithm for feed-forward neural networks. Neural Processing Letters 17 1 (2003) 93-105
39. Chang F.P., and Hwang C. Design of digital PID controllers for continuous-time plants with integral performance criteria. Journal of the Chinese Institute of Chemical Engineers 35 6 (2004) 683-696
40. Chang Y.P., and Wu C.J. Optimal multiobjective planning of large-scale passive harmonic filters using hybrid differential evolution method considering parameter and loading uncertainty. IEEE Transactions on Power Delivery 20 1 (2005) 408-416
41. Onwubolu G.C. Optimizing CNC drilling machine operations: traveling salesman problem-differential evolution approach. In: Onwubolu G.C., and Babu B.V. (Eds). New optimization techniques in engineering (2004), Springer, Heidelberg, Germany 537-565
42. Nearchou A.C. Meta-heuristics from nature for the loop layout design problem. International Journal of Production Economics 101 2 (2006) 312-328
43. Lampinen J., and Zelinka I. Mechanical engineering design optimization by differential evolution. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, London (UK) 127-146
44. Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G, 2004. Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion. In: Fourth international symposium on intelligent manufacturing systems. Sakarya, Turkey; 2004. p. 442-52.
45. Onwubolu G., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 2 (2006) 674-692
46. Nearchou AC. A differential evolution approach for the common due date early/tardy job scheduling problem. Computers & Operations Research, 2006, doi: 10.1016/j.cor.2006.08.013.
47. Kong X.H., Xu W.B., and Liu J. A permutation-based differential evolution algorithm incorporating simulated annealing for multiprocessor scheduling with communication delays. Lecture notes in computer science vol. 3991 (2006), Springer, Berlin 514-521
48. Reeves C.R., and Yamada T. Genetic algorithms. path relinking and the flowshop sequencing problem, Evolutionary Computation 6 (1998) 45-60
49. Reeves C.R. Landscapes operations and heuristic search. Annals of Operations Research 86 (1999) 473-490
50. Nowicki E., and Smutnicki C. Some aspects of scatter search in the flow-shop problem. European Journal of Operational Research 169 (2006) 654-666
51. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47 (1990) 65-74
52. Pinedo M. Scheduling: theory, algorithms and systems (2002), Prentice-Hall, New Jersey
53. 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.
54. Price K, Storn R. Differential evolution homepage (Web site of Price and Storm) as at 2007. 〈http://www.icsi.berkeley.edu/∼storn/code.html〉.
55. Bean J.C. Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6 2 (1994) 154-160
56. Schiavinotto T., and Stützle T. A review of metrics on permutations for search landscape analysis. Computers Operations & Research 34 10 (2007) 3143-3153
57. Geiger M.J. On operators and search space topology in multi-objective flow shop scheduling. European Journal of Operational Research 181 1 (2007) 195-206
58. Zitzler E., Deb K., and Thiele L. Comparison of multiobjective evolutionary algorithms: empirical results. IEEE Transactions on Evolutionary Computation 8 2 (2000) 173-195
59. Iosifescu M. Finite Markov processes and their applications (1980), Wiley, Chichester, UK
60. Carlier J. Ordonnancements a contraintes disjonctives. RAIRO-Operations Reasearch 12 (1978) 333-351
61. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers & Operations Research 22 (1995) 5-13
62. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
63. Zitzler E., and Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation 3 4 (1999) 257-271
64. 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
65. Van Veldhuizen DA. Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. PhD dissertation, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio, May; 1999.
66. Czyzak P., and Jaszkiewicz A. Pareto-simulated annealing-a metaheuristic technique for multi-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis 7 1 (1998) 34-47
67. Knowles JD, Corne DW, On metrics for comparing nondominated sets. In: 2002 Congress on Evolutionary Computation. p. 711-6.
68. Jaszkiewicz A. Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem. IEEE Transactions on Evolutionary Computation 7 2 (2003) 133-143