Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop

2010 Chinese Control and Decision Conference, CCDC 2010

Volumn , Issue , 2010, Pages 1184-1188

  Gao, K Z ^a   Li, H ^a   Pan, Q K ^a   Li, J Q ^a   Liang, J J ^b  

^a LIAOCHENG UNIVERSITY   (China)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

Flow shop; Harmony search; No wait; Total flow time

Indexed keywords

EFFECTIVE ALGORITHMS; FLOW-SHOP SCHEDULING; FLOW-SHOPS; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; HYBRID HEURISTICS; JOB SEQUENCES; NO-WAIT; NO-WAIT FLOW SHOP; NOVEL METHODS; REAL VECTOR; TOTAL FLOWTIME;

LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; WAVELET TRANSFORMS;

OPTIMIZATION;

EID: 77955373791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2010.5498155     Document Type: Conference Paper

References (17)

1. B. Liu, L. Wang, and Y. H. Jin, "An effective hybrid particle swarm optimization for no-wait flow shop scheduling," International Journal of Advanced Manufacturing Technology, 2007, vol. 31, pp. 1001-1011.
2. Q. K. Pan, M. F. Tasgetiren, and Y. C. Liang, "A discrete particle swarm optimizatioin algorithm for the no-wait flowshop scheduling problem with makespan criterion,"Preceedings of the international Workshop on UK Planning and Scheduling Special interest Group, London: City University, 2005, pp. 31-41.
3. G. Onwubolu, and D. Davendra, "Scheduling flow shops using differential evolution algorithm, " European Journal of Operational Research, 2006, vol. 171(2), pp. 673-692.
4. Sviridenko, M., Makespan minimization in no-wait flow shops: A polynomial time approximation scheme. SIAM Journal on Discrete Mathematics, 2003, vol.16(2),313-322.
5. Chen C. L., Neppalli R. V., Aljaber N. , Genetic algorithms applied to the continuous flow shop problem. Computers & Industrial Engineering, 1996, vol.30, 919-929.
6. Allahverdi A., Aldowaisan T. , No-wait flowshops with bicriteria of makespan and maximum lateness. European Journal of Operational Research, 2004,vol.152, 132-147.
7. Liu B., Wang L., Jin Y. H., An effective hybrid particle swarm optimization for no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology, 2007, vol. 31(9-10), 1001-1011. (Pubitemid 46092501)
8. Grabowski J., Pempera J., Some local search algorithms for no-wait flowshop problem with makespan criterion. Computers & Operations Research, 2005, vol. 32, 2197-2212.
9. B. Qian, et al, A DE-based approach to no-wait flow-shop scheduling. Computer & Industrial Engineering, 2009, 2, 006-024.
10. Quan-Ke Pan, M. Fatih Tasgetiren, Yun-Chia Liang, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computer and Operations Reasearch, 2008, vol. 35(9), 2807-2839.
11. M. Mahdavi, M. Fesanghary, E. Damangir, "An improved harmony search algorithm for solving optimization probems," Applied Mathematics and Computation, 2007, vol. 188, pp. 1567-1579.
12. Z. W. Geem, J. .H. Kim, and G. V. Loganathan, "A new heuristic optimization algorithm: harmony search," Simulation, 2001, vol. 76(2), pp. 60-68.
13. Z. W. Geem, J. .H. Kim, and G. V. Loganathan, "Harmony search optimization: application to pipe network design," Int. J. Model. Simul. , 2002, vol. 22(2), pp.125-133.
14. K. S. Lee and Z. W. Geem, "A new meta-heuristic algorithm for continues engineering optimization: harmony search theory and practice," Comput. Meth. Appl. Meth. Eng., 2004, vol. 194, pp. 3902-3933.
15. J. C. Bean, "Genetic algorithm and random keys for sequencing and optimization," ORSA Journal on Computing, 1994, vol. 6(2), pp. 154-160.
16. th international symposium on interlligent manufacturing system, Sakarya, Turkey, 2004, pp. 442-452.
17. Q. K. Pan, M. F. Tasgetiren, Y. C. Liang. "A Discrete Particle Swarm Optimization Algorithm for the No-Wait Flowshop Scheduling Problem ," Computers and Operations Research, 2008, vol. 35(9), pp. 2807-2839.