{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:06:05Z","timestamp":1742987165552,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319318530"},{"type":"electronic","value":"9783319318547"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31854-7_62","type":"book-chapter","created":{"date-parts":[[2016,4,30]],"date-time":"2016-04-30T14:34:17Z","timestamp":1462026857000},"page":"676-682","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Particle Swarm Optimization Algorithm for Permutation Flow-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Yucheng","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,1]]},"reference":[{"issue":"16","key":"62_CR1","doi-asserted-by":"publisher","first-page":"4732","DOI":"10.1080\/00207543.2013.767988","volume":"51","author":"X Li","year":"2013","unstructured":"Li, X., Yin, M.: A hybrid cuckoo search via Levy flights for the permutation flow shop scheduling problem. Int. J. Prod. Res. 51(16), 4732\u20134754 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"62_CR2","first-page":"133","volume":"419","author":"CH Qiu","year":"2010","unstructured":"Qiu, C.H., Wang, C.: An immune particle swarm optimization algorithm for solving permutation flowshop problem. Key Eng. Mater. 419, 133\u2013136 (2010)","journal-title":"Key Eng. Mater."},{"key":"62_CR3","unstructured":"Zhanke, Yu., Mingfang, N., Zeyan W.: Improved branch and bound algorithm. J. Comput. Appl. (2011). s2"},{"issue":"11","key":"62_CR4","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1080\/00207549008942855","volume":"28","author":"R Leisten","year":"1990","unstructured":"Leisten, R.: Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res. 28(11), 2085\u20132100 (1990)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"62_CR5","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithms for flow-shop scheduling problems. Comput. Ind. Eng. 30(4), 1061\u20131071 (1996)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"62_CR6","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","volume":"13","author":"Y-F Liu","year":"2013","unstructured":"Liu, Y.-F., Liu, S.-Y.: A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl. Soft Comput. 13(3), 1459\u20131463 (2013)","journal-title":"Appl. Soft Comput."},{"key":"62_CR7","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38, 3563\u20133573 (2011)","journal-title":"Expert Syst. Appl."},{"key":"62_CR8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.amc.2015.03.059","volume":"260","author":"TF Abdelmaguid","year":"2015","unstructured":"Abdelmaguid, T.F.: A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times. Appl. Math. Comput. 260, 188\u2013203 (2015)","journal-title":"Appl. Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Human Centered Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31854-7_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T04:05:10Z","timestamp":1718510710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31854-7_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319318530","9783319318547"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31854-7_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}