A hybrid discrete harmony search algorithm for blocking flow shop scheduling

Proceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

Volumn , Issue , 2010, Pages 435-438

  Han, Yu Yan ^a   Pan, Quan Ke ^a   Liang, J J ^b   Li, Jun Qing ^a  

^a LIAOCHENG UNIVERSITY   (China)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

Blocking flow shop scheduling; Discrete harmony search algorithm; Evolutionary algorithm; Local search algorithm

Indexed keywords

BLOCKING FLOW; COMPUTATIONAL SIMULATION; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; INSERT NEIGHBORHOOD; LOCAL SEARCH ALGORITHM; MAKESPAN;

COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; SCHEDULING ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 78650588930     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BICTA.2010.5645164     Document Type: Conference Paper

References (22)

1. Pinedo, M, "Scheduling, theory, algorithms and systems", New Jersey: PrenticeHall. 2002.
2. Suhami, I. and R.S.H. Mah, "An Implicit Enumeration Scheme for the Flowshop Problem with No Intermediate Storage", Computers and Chemical Engineering, vol. 5, pp 83-91, 1981.
3. Grabowski J, Pempera J, "Sequencing of jobs in some production system", European Journal of Operational Research, vol. 125, pp 535-550, 2000.
4. Allahverdi, A., Ng, C. T., Cheng, T. C. E., et al. "A survey of scheduling problemswith setup times or costs", European Journal of Operational Research, vol. 187, pp 985 -1032, 2008.
5. Storn R, Price K, "Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces", Journal of Global Optimization, vol. 11, pp 341 -59, 1997.
6. Abadi, I. N. K., Hall, N. G., Sriskandarajh, C, "Minimizing cycle time in a blocking flowshop", Operations Research, vol. 48, pp 177 - 180, 2000.
7. McCormich ST, Pinedo ML, Shenker S, Wolf B, "Sequencing in an assembly line with blocking to minimize cycle time", Operations Research, vol. 37, pp 925-36, 1989.
8. Leisten R, "Flowshop sequencing problems with limited buffer storage", International Journal of Production Research, vol. 28, pp 2085-2100, 1990.
9. Nawaz M, Enscore EEJ, Ham I, "A heuristic algorithm for them-machine, n-job flow shop sequencing problem", International Journal of Management Science, vol. 11, pp 91 -95, 1983.
10. Ronconi DP, "A note on constructive heuristics for the flowshop problem with blocking", International Journal of Production Economics, vol. 87, pp 39-48, 2004.
11. Debora P. Ronconi, Luis R.S. Henriques, "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking", International Journal of Management Science, vol. 37, pp 272-281, 2009.
12. Caraffa V, lanes S, Bagchi TP, Sriskandarajah C, "Minimizing makes pan in a blocking flowshop using genetic algorithms", International Journal of Production Economics, vol. 70, pp 102-115, 2001.
13. I.N.K. Abadi, "Flowshop scheduling problems with no-wait and blocking environments", A mathematical programming approach, Ph.D. Thesis, Department of Industrial Engineering, University of Toronto, Canada, 1995.
14. Grabowski J, Pempera J, "The permutation flow shop problem with blocking", A tabu search approach, vol. 35, pp 302-311, 2007.
15. Q.K. Pan, M.F. Tasgetiren, Y.C. Liang. A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers and Industrial Engineering, vol. 55, pp 795-816, 2008.
16. Geem ZW, Kim J-H, Loganathan GV, "A new heuristic optimization algorithm: harmony search", Simulations, vol. 76, pp 60-68, 2001.
17. K.S.Lee, Z.W.Geem, S. H. Lee, K. W. Bae, "The harmony search heuristic algorithm for discrete structural optimization", Eng Optimiz, vol. 37, pp 663-684, 2005.
18. Z.W.Geem, "Optimal cost design of water distribution networks using harmony search", Eng Optimiz, vol. 38, pp 259-280, 2006.
19. HONG Zong-you, YAN Ping, PANG Ha-li, "Study on minimum blocked time algorithm for blocking flow shop scheduling", Journal of Liaoning Normal University, vol. 30, pp 148- 151, 2007.
20. R. Ruiz, T. Stutzle, "A simple and effective iterated greedy algorithm for the permutation flow shop scheduling problem", European Journal of Operational Research, vol. 177, pp 2033-2049, 2007.
21. Taillard E, "Benchmarks for basic scheduling problems", European Journal of Operational Research, vol. 64, pp 278-85, 1993.
22. Ronconi DP, "A branchi-and-bound algorithm to minimize the makes pan in a flowshop with blocking", Annals of Operations Research, vol. 138, pp 53-65, 2005.