A hybrid quantum-inspired genetic algorithm for flow shop scheduling

Lecture Notes in Computer Science

Volumn 3645, Issue PART II, 2005, Pages 636-644

  Wang, Ling ^a   Wu, Hao ^a   Tang, Fang ^b   Zheng, Da Zhong ^a  

^a TSINGHUA UNIVERSITY   (China)

^b BEIHANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL OPERATORS; QUANTUM THEORY; SCHEDULING;

FLOW SHOP SCHEDULING; GENETIC OPERATORS; HYBRID QUANTUM-INSPIRED GENETIC ALGORITHMS (HQGA); QUANTUM GATES;

GENETIC ALGORITHMS;

EID: 27144511211     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538356_66     Document Type: Conference Paper

References (15)

1. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, (1979)
2. Nawaz, M., Enscore, E.Jr., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega, 11 (1983) 91-95
3. Ogbu, F.A., Smith, D.K.: Simulated annealing for the permutation flowshop problem. Omega, 19 (1990) 64-67
4. Wang, L., Zhang, L., Zheng, D.Z.: A class of order-based genetic algorithm for flow shop scheduling. International Journal of Advanced Manufacture Technology, 22 (2003) 828-835
5. Wang, L., Zheng, D.Z.: A modified evolutionary programming for flow shop scheduling. International Journal of Advanced Manufacturing Technology, 22 (2003) 522-527
6. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European J. Operational Research, 91 (1996) 160-175
7. Wang, L., Zheng, D.Z.: An effective hybrid heuristic for flow shop scheduling. International Journal of Advanced Manufacture Technology, 21 (2003) 38-44
8. Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput., 6 (2002) 580-593
9. Han, K.H., Kim, J.H.: A Quantum-inspired evolutionary algorithms with a new termination criterion, He gate, and two-phase scheme. IEEE Trans. Evol. Comput., 8 (2004) 156-169
10. Han, K.H., Kim, J.H.: Genetic quantum algorithm and its application to combinatorial optimization problem. In: IEEE Proc. of CEC, (2000) 1354-136
11. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6 (1994) 154-160
12. Wang, L.: Intelligent Optimization with Applications. Tsinghua University & Springer Press, Beijing, (2001)
13. Carlier, J.: Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle/ Operations Research, 12 (1978) 333-351
14. Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers and Operations Research, 22 (1995) 5-13
15. Wang, L., Zheng, D.Z.: An effective hybrid optimization strategy for job-shop scheduling problems. Computers and Operations Research, 28 (2001) 585-596