Abstract
Quantum algorithm is applied to Parallel Flow shop scheduling problem which has the characters of the parallel machines scheduling and the flow shop scheduling. In this paper, quantum bit encoding strategy of quantum algorithm is designed to a general Parallel Flow shop problem with the objective of minimizing Makespan. All the scheduling problems are represented by the quantum bits. This algorithm is tested on some randomly generated problems with different scale sizes and compared with GA algorithms. Computational results show that the QA and the encoding strategy have shown exciting performance in obtaining the most accurate and optimal solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Li, C., Cheng, T.: The parallel machine minmax weigthed absolute lateness scheduling problem. Naval Research Logistics (41), 33–46 (1993)
Widmer, M., Hertz, A.: A new heuristic method for the flow shop sequencing problem. Eur. J. Opl. Res. (41), 183–193 (1989)
Sundararaghavan, P., Kunnathur, A., Viswanathan, I.: Minimizing Makespan in Parallel Flow shop. Opns. Res. Soc. (48), 834–842 (1997)
Pang, H.L., Wan, S.S.: Study on Parallel Flow shop Scheduling Problem Using Probability Learning Based Evolutionary Algorithm. Control Theory & Applications (22)-1, 149–152 (2005)
Feynman, R.: International Theoretical Physics. (21), 467–488 (1982)
Deutsch, D.: Proc. R Soc. London A (400), 97–117 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, Y., Wan, S. (2011). Parallel Flow Shop Scheduling Problem Using Quantum Algorithm. In: Zhang, J. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23223-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-23223-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23222-0
Online ISBN: 978-3-642-23223-7
eBook Packages: Computer ScienceComputer Science (R0)