Abstract
This paper is the first to propose a quantum-inspired genetic algorithm (QGA) for permutation flow shop scheduling problem to minimize the maximum completion time (makespan). In the QGA, Q-bit based representation is employed for exploration in discrete 0-1 hyperspace by using updating operator of quantum gate as well as genetic operators of Q-bit. Meanwhile, the Q-bit representation is converted to random key representation, which is then transferred to job permutation for objective evaluation. Simulation results and comparisons based on benchmarks demonstrate the effectiveness of the QGA, whose searching quality is much better than that of the famous NEH heuristic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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, pp. 212–221 (1996)
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, pp. 20–22 (1994)
Wang, L.: Intelligent Optimization with Applications. Tsinghua University & Springer Press, Beijing (2001)
Narayanan, A., Moore, M.: Quantum inspired genetic algorithm. In: IEEE International Conference on Evolutionary Computation, Piscataway, pp. 61–66 (1996)
Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evolutionary Computation 6, 580–593 (2002)
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, 156–169 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Nawaz, M., Enscore Jr., E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11, 91–95 (1983)
Ogbu, F.A., Smith, D.K.: Simulated annealing for the permutation flowshop problem. Omega 19, 64–67 (1990)
Wang, L., Zhang, L., Zheng, D.Z.: A class of order-based genetic algorithm for flow shop scheduling. Int. J. Advanced Manufacture Technology 22, 828–835 (2003)
Wang, L., Zheng, D.Z.: A modified evolutionary programming for flow shop scheduling. Int. J. Advanced Manufacturing Technology 22, 522–527 (2003)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European J. Operational Research 91, 160–175 (1996)
Wang, L., Zheng, D.Z.: An effective hybrid heuristic for flow shop scheduling. Int. J. Advanced Manufacture Technology 21, 38–44 (2003)
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6, 154–160 (1994)
Carlier, J.: Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle/Operations Research 12, 333–351 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Wu, H., Zheng, Dz. (2005). A Quantum-Inspired Genetic Algorithm for Scheduling Problems. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_50
Download citation
DOI: https://doi.org/10.1007/11539902_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)