A quantum-inspired genetic algorithm for scheduling problems

Lecture Notes in Computer Science

Volumn 3612, Issue PART III, 2005, Pages 417-423

  Wang, Ling ^a   Wu, Hao ^a   Zheng, Da Zhong ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER SIMULATION; PERMAFROST; PROBLEM SOLVING; QUANTUM THEORY; SCHEDULING;

PERMUTATION FLOW SHOP SCHEDULING; Q-BIT; QUANTUM GATE; QUANTUM-INSPIRED GENETIC ALGORITHM (QGA);

GENETIC ALGORITHMS;

EID: 26844468562     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539902_50     Document Type: Conference Paper

References (15)

1. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Pennsylvania, (1996) 212-221
2. Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on the Foundation of Computer Sciences. Los Alamitos, (1994) 20-22
3. Wang, L.: Intelligent Optimization with Applications. Tsinghua University & Springer Press, Beijing, (2001)
4. Narayanan, A., Moore, M.: Quantum inspired genetic algorithm. In: IEEE International Conference on Evolutionary Computation, Piscataway, (1996) 61-66
5. Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evolutionary Computation, 6 (2002) 580-593
6. 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
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, (1979)
8. Nawaz, M., Enscore, E.Jr., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega, 11 (1983) 91-95
9. Ogbu, F.A., Smith, D.K.: Simulated annealing for the permutation flowshop problem. Omega, 19 (1990) 64-67
10. Wang, L., Zhang, L., Zheng, D.Z.: A class of order-based genetic algorithm for flow shop scheduling. Int. J. Advanced Manufacture Technology, 22 (2003) 828-835
11. Wang, L., Zheng, D.Z.: A modified evolutionary programming for flow shop scheduling. Int. J. Advanced Manufacturing Technology, 22 (2003) 522-527
12. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European J. Operational Research, 91 (1996) 160-175
13. Wang, L., Zheng, D.Z.: An effective hybrid heuristic for flow shop scheduling. Int. J. Advanced Manufacture Technology, 21 (2003) 38-44
14. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6 (1994) 154-160
15. Carlier, J.: Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle/ Operations Research, 12 (1978) 333-351