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

International Journal of Production Research

Volumn 47, Issue 1, 2009, Pages 1-24

  Qian, B ^a,b   Wang, L ^a   Huang, D X ^a   Wang, X ^a  

^a TSINGHUA UNIVERSITY   (China)

^b KUNMING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Differential evolution; Exploration and exploitation; Flow shop scheduling; Hybrid algorithm; Limited buffers; Local search

Indexed keywords

CIRCUIT THEORY; EVOLUTIONARY ALGORITHMS; MACHINE SHOP PRACTICE; MARKOV PROCESSES; MATHEMATICAL TRANSFORMATIONS; MOBILE TELECOMMUNICATION SYSTEMS; NUCLEAR PROPULSION; SCHEDULING;

DIFFERENTIAL EVOLUTION; EXPLORATION AND EXPLOITATION; FLOW SHOP SCHEDULING; HYBRID ALGORITHM; LIMITED BUFFERS; LOCAL SEARCH;

DIGITAL ARITHMETIC;

EID: 56349108521     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701528750     Document Type: Article

References (38)

1. Bean, J.C., Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput., 1994, 6, 154-160.
2. Brucker, P., Heitmann, S. and Hurink, J., Flow-shop problems with intermediate buffers. O R Spectrum, 2003, 25, 549-574.
3. Carlier, J., Ordonnancements a contraintes disjonctives. RAIRO-Oper. Res., 1978, 12, 333-351.
4. 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 T. Power Deliver, 2005, 20, 408-416.
5. Golub, G.H. and Van Loan, C.F., Matrix Computadnos, 3rd ed., 1996 (Johns Hopkins University Press: Baltimore).
6. Grabowski, J. and Wodecki, M., A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res., 2004, 31, 1891-1909.
7. Grabowski, J., Skubalska, E. and Smutnicki, C., On flow shop scheduling with release and due dates to minimize maximum lateness. J. Oper. Res. Soc., 1983, 34, 615-620.
8. Hall, N.G. and Sriskandarajah, C., A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res., 1996, 44, 510-525.
9. Hart, W.E., Krasnogor, N. and Smith, J.E., Recent Advances in Memetic Algorithms, 2004 (Springer: Heidelberg).
10. Ilonen, J., Kamarainen, J.K. and Lampinen, J., Differential evolution training algorithm for feed-forward neural networks. Neural Process Lett., 2003, 17, 93-105.
11. Iosifescu, M., Finite Markov Processes and their Applications, 2004 (Wiley: Chichester, UK).
12. Ishibuchi, H., Misaki, S. and Tanaka, H., Modified simulated annealing algorithms for the flow shop sequencing problem. Eur. J. Oper. Res., 1995, 81, 388-398.
13. Krasnogor, N., Studies on the theory and design space of memetic algorithms. PhD thesis, University of the West of England, Bristol, UK, 2002.
14. Leisten, R., Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res., 1990, 28, 2085-2100.
15. Nawaz, M., Enscore, E. and Ham, L, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 1983, 11, 91-95.
16. Nearchou, A.C., A differential evolution approach for the common due date early/tardy job scheduling problem. Comput. Oper. Res., DOI: 10.1016/j.cor.2006.08.013.
17. Nowicki, E., The permutation flow shop with buffers: a tabu search approach. Eur. J. Oper. Res., 1999, 116, 205-219.
18. Nowicki, E. and Smutnicki, C., A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res., 1996, 91, 160-175.
19. Nowicki, E. and Smutnicki, C., Some aspects of scatter search in the flow-shop problem. Eur. J. Oper. Res., 2006, 169, 654-666.
20. Ong, Y.S. and Keane, A.J., Meta-Lamarckian learning in memetic algorithms. IEEE T. Evolut. Comput., 2004, 8, 99-110.
21. Ong, Y.S., Lim, M.H., Zhu, N. and Wong, K.W., Classification of adaptive memetic algorithms: a comparative study. IEEE T. Syst., Man, Cybern. B., 2006, 36, 141-152.
22. Onwubolu, G. and Davendra, D., Scheduling flow shops using differential evolution algorithm. Eur. J. Oper. Res., 2006, 171, 674-692.
23. Osman, I.H. and Potts, C.N., Simulated annealing for permutation flow-shop scheduling. OMEGA, 1989, 17, 551-557.
24. Papadimitriou, C.H. and Kanellakis, P.C., Flow shop scheduling with limited temporary storage. J. ACM, 1980, 27, 533-549.
25. Price, K. and Storn, R., Differential evolution homepage (Web site of Price and Storm) as at 2007. Available online at: http://www.icsi.berkeley.edu/ ~storn/code.html
26. Reeves, C.R., A genetic algorithm for flowshop sequencing. Comput. Oper. Res., 1995, 22, 5-13.
27. Reeves, C.R., Landscapes, operations and heuristic search. Ann. Oper. Res., 1999, 86, 473-490.
28. Reeves, C.R. and Yamada, T., Genetic algorithms, path relinking and the flowshop sequencing problem. Evol. Comput., 1998, 6, 45-60.
29. Ronconi, D.P., A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Ann. Oper. Res., 2005, 138, 53-65.
30. Sikora, R., A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Comput. Ind. Eng., 1996, 30, 969-981.
31. Smutnicki, C., A two-machine permutation flow shop scheduling problem with buffers. OR Spectrum, 1998, 20, 229-235.
32. Storn, R. and Price, K., Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim., 1997, 11, 341-359.
33. Taillard, E., Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res., 1990, 47, 65-74.
34. Taillard, E., Benchmarks for basic scheduling problems. Eur. J. Oper. Res., 1993, 64, 278-285.
35. Tasgetiren, M.F., Liang, Y.C., Sevkli, M. and Gencyilmaz, G., Differential evolution algorithm for permutation flowshop sequencing problem with makespan criterion, in: 4th International Symposium on Intelligent Manufacturing Systems, Sakarya, Turkey, 2004, pp. 442-452.
36. Wang, L., Shop Scheduling With Genetic Algorithms, 2003 (Tsinghua University Press & Springer: Beijing).
37. Wang, L. and Zheng, D.Z., An effective hybrid heuristic for flow shop scheduling. Int. J. Adv. Manuf Tech., 2003, 21, 38-44.
38. Wang, L., Zhang, L. and Zheng, D.Z., An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res., 2006, 33, 2960-2971.