{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:56:54Z","timestamp":1773964614356,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540282273","type":"print"},{"value":"9783540319078","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538356_66","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:24:05Z","timestamp":1127831045000},"page":"636-644","source":"Crossref","is-referenced-by-count":29,"title":["A Hybrid Quantum-Inspired Genetic Algorithm for Flow Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Ling","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Da-Zhong","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"66_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega\u00a011, 91\u201395 (1983)","journal-title":"Omega"},{"key":"66_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0305-0483(91)90036-S","volume":"19","author":"F.A. Ogbu","year":"1990","unstructured":"Ogbu, F.A., Smith, D.K.: Simulated annealing for the permutation flowshop problem. Omega\u00a019, 64\u201367 (1990)","journal-title":"Omega"},{"key":"66_CR4","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/s00170-003-1689-8","volume":"22","author":"L. Wang","year":"2003","unstructured":"Wang, L., Zhang, L., Zheng, D.Z.: A class of order-based genetic algorithm for flow shop scheduling. International Journal of Advanced Manufacture Technology\u00a022, 828\u2013835 (2003)","journal-title":"International Journal of Advanced Manufacture Technology"},{"key":"66_CR5","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/s00170-002-1477-x","volume":"22","author":"L. Wang","year":"2003","unstructured":"Wang, L., Zheng, D.Z.: A modified evolutionary programming for flow shop scheduling. International Journal of Advanced Manufacturing Technology\u00a022, 522\u2013527 (2003)","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"66_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European J. Operational Research\u00a091, 160\u2013175 (1996)","journal-title":"European J. Operational Research"},{"key":"66_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1504\/IJMTM.2003.002528","volume":"21","author":"L. Wang","year":"2003","unstructured":"Wang, L., Zheng, D.Z.: An effective hybrid heuristic for flow shop scheduling. International Journal of Advanced Manufacture Technology\u00a021, 38\u201344 (2003)","journal-title":"International Journal of Advanced Manufacture Technology"},{"key":"66_CR8","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"K.H. Han","year":"2002","unstructured":"Han, K.H., Kim, J.H.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput.\u00a06, 580\u2013593 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"66_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TEVC.2004.823467","volume":"8","author":"K.H. Han","year":"2004","unstructured":"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.\u00a08, 156\u2013169 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"66_CR10","unstructured":"Han, K.H., Kim, J.H.: Genetic quantum algorithm and its application to combinatorial optimization problem. In: IEEE Proc. of CEC, pp. 1354\u20131356 (2000)"},{"key":"66_CR11","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing\u00a06, 154\u2013160 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"66_CR12","volume-title":"Intelligent Optimization with Applications","author":"L. Wang","year":"2001","unstructured":"Wang, L.: Intelligent Optimization with Applications. Tsinghua University & Springer Press, Beijing (2001)"},{"key":"66_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1051\/ro\/1978120403331","volume":"12","author":"J. Carlier","year":"1978","unstructured":"Carlier, J.: Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle\/ Operations Research\u00a012, 333\u2013351 (1978)","journal-title":"R.A.I.R.O. Recherche operationelle\/ Operations Research"},{"key":"66_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C.R. Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers and Operations Research\u00a022, 5\u201313 (1995)","journal-title":"Computers and Operations Research"},{"key":"66_CR15","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L. Wang","year":"2001","unstructured":"Wang, L., Zheng, D.Z.: An effective hybrid optimization strategy for job-shop scheduling problems. Computers and Operations Research\u00a028, 585\u2013596 (2001)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538356_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:32Z","timestamp":1605644012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538356_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282273","9783540319078"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11538356_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}