A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 509-520

  Wang, Ling ^a   Pan, Quan Ke ^b   Suganthan, P N ^c   Wang, Wen Hong ^b   Wang, Ya Min ^b  

^a TSINGHUA UNIVERSITY   (China)

^b LIAOCHENG UNIVERSITY   (China)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Blocking flow shop; Differential evolution; Discrete differential evolution; Hybrid algorithm; Local search; Speed up

Indexed keywords

BLOCKING FLOW SHOP; DIFFERENTIAL EVOLUTION; DISCRETE DIFFERENTIAL EVOLUTION; HYBRID ALGORITHM; LOCAL SEARCH; SPEED-UP;

COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; MATHEMATICAL OPERATORS; OPERATIONS RESEARCH; RESEARCH; SCHEDULING ALGORITHMS; TABU SEARCH;

EVOLUTIONARY ALGORITHMS;

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

References (35)

1. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
2. Grabowski J., and Pempera J. The permutation flow shop problem with blocking. A tabu search approach 35 (2007) 302-311
3. 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 and operations research 36 1 (2009) 209-233
4. Ronconi D.P. A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research 138 1 (2005) 53-65
5. Pinedo M. Scheduling: theory, algorithms and systems (2002), Prentice-Hall, NJ
6. Wang L., and Zheng D.Z. An effective hybrid heuristic for flow shop scheduling. International Journal of Advanced Manufacturing Technology 21 (2003) 38-44
7. Pan Q.-K., and Wang L. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology 39 (2008) 796-807
8. Pan Q.-K., Tasgetiren M.F., and Liang Y.-C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research 35 9 (2008) 2807-2839
9. Ronconi D.P. A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics 87 (2004) 39-48
10. Grabowski J., and Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 125 (2000) 535-550
11. 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
12. Tonconi D.P., and Henriques L.R.S. Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. OMEGA-International Journal of Management Science 37 2 (2009) 272-281
13. McCormich S.T., Pinedo M.L., Shenker S., and Wolf B. Sequencing in an assembly line with blocking to minimize cycle time. Operations Research 37 (1989) 925-936
14. Leisten R. Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 28 (1990) 2085-2100
15. Ronconi D.P., and Armentano V.A. Lower bounding schemes for flowshops with blocking in-process. Journal of the Operational Research Society 52 (2001) 1289-1297
16. 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
17. Abadi I.N.K., Hall N.G., and Sriskandarajh C. Minimizing cycle time in a blocking flowshop. Operations Research 48 (2000) 177-180
18. Caraffa V., Ianes S., Bagchi T.P., and Sriskandarajah C. Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics 70 (2001) 101-115
19. 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
20. 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 (2004) 683-696
21. Ilonen J., Kamarainen J.K., and Lampinen J. Differential evolution training algorithm for feed-forward neural networks. Neural Process Letters 17 (2003) 93-105
22. Storn R. Designing digital filters with differential evolution. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, London, UK
23. Ruzek B., and Kvasnicka M. Differential evolution in the earthquake hypocenter location. Pure and Applied Geophysics 158 (2001) 667-693
24. 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
25. Onwubolu G.C., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 2 (2006) 674-692
26. 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. p. 251-8.
27. 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
28. Qian B., Wang L., Huang D.X., and Wang X. An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers. International Journal of Production Research 36 1 (2009) 209-233
29. Pan Q.-K., and Wang L. A novel differential evolution algorithm for the no-idle permutation flow shop scheduling problems. European Journal of Industrial Engineering 2 3 (2008) 279-297
30. Pan Q-K, Tasgetiren MF, Liang Y-C. A discrete differential evolution algorithm for the permutation flowshop scheduling problem. In: Proceedings of the Ninth annual conference on genetic and evolutionary computation, London, England; 2007. p. 126-33.
31. Tasgetiren MF, Pan Q-K, Liang Y-C. A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In: Proceedings of the ninth annual conference on genetic and evolutionary computation, London, England; 2007. p. 158-67.
32. Grabowski J., and Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers and Operations Research 32 (2005) 2197-2212
33. Taillard E. Some efficient heuristic methods for the flow shop sequencing problems. European Journal of Operational Research 47 (1990) 65-74
34. Smutncki C. A two-machine permutation flow shop scheduling problem with buffers. OR Spectrum; 1998.
35. Zhu Q.-Y., Qin A.K., Suganthan P.N., and Huang G.-B. Evolutionary extreme learning machine. Pattern Recognition 38 10 (2005) 1759-1763