{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T04:31:26Z","timestamp":1747801886413,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155531"},{"type":"electronic","value":"9783319155548"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15554-8_38","type":"book-chapter","created":{"date-parts":[[2015,3,3]],"date-time":"2015-03-03T12:12:48Z","timestamp":1425384768000},"page":"465-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Lin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jianhua","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Yuyan","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,4]]},"reference":[{"key":"38_CR1","unstructured":"Wu, C., Gu, X.: A genetic algorithm for flow shop scheduling with fuzzy processing time and due date. In: Proceedings of 5th World Congress on Control and Automation, pp. 2983\u20132942 (June 2004)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/S0305-0483(01)00046-9","volume":"29","author":"AA Kalir","year":"2001","unstructured":"Kalir, A.A., Sarin, S.C.: A near-optimal heuristic for the sequence problem in multiple-batch flow \u2013shops with small equal stublots. Omega 29, 577\u2013584 (2001)","journal-title":"Omega"},{"key":"38_CR3","unstructured":"Dou, J., Li, J.: Adiscrete particle swarm algorithm foe makespan minimization in the permutation flowsshop scheduling problem. In: Proc. IEEE International Conference on Evolutionary Computation, pp. 69\u201373 (2013)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-28646-2_38","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"M Fatih Tasgetiren","year":"2004","unstructured":"Fatih Tasgetiren, M., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 382\u2013389. Springer, Heidelberg (2004)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Han, Y.-Y., Duan, J.-H., Zhang, M.: Apply the discrete artifical bee colony algorithm to the blocking flow shop problem with makespan criterion. In: Chinese Control and Decision Conference (CCDC), pp. 2135\u20132139 (2011)","DOI":"10.1109\/CCDC.2011.5968558"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Dong, J.-M., Hu, J.-L., Chen, Y.: Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage. Appl. Math. J. Chinese. Univ., 358\u2013368 (2013)","DOI":"10.1007\/s11766-013-3146-2"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Duan, J.-H., Zhang, M., Qiao, G.-Y., Li, J.-Q.: AGenetic algorithm for permutation flowshop scheduling with total flowtime criterion. In: Chinese Control and Decision Conference (CCDC), pp. 1514\u20131518 (2011)","DOI":"10.1109\/CCDC.2011.5968432"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Zeng, C., Tang, J., Zhu, H.: Two heuristic algorithms of job scheduling problem with inter-cell production mode in hybrid operations of machining. In: Chinese Control and Decision Conference (CCDC), pp. 1282\u20131285 (2013)","DOI":"10.1109\/CCDC.2013.6561122"},{"key":"38_CR9","unstructured":"Wisittipanich, W., Kachitvichyanukul, V.: Differential evolution algorithm for makespan minimization in flexible job shop scheduling problem. In: Proceeding of 12th Asia Pacific Industrial Engineering and Management Systems Conference, pp. 104\u2013110 (2011)"},{"issue":"4","key":"38_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C Oguz","year":"2004","unstructured":"Oguz, C., Ercan, M.: A genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks. Journal of Scheduling. 8(4), 323\u2013351 (2004)","journal-title":"Journal of Scheduling."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE Conference on Neural Network, pp. 1942\u20131948. IEEE Press, Piscataway (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Chang, J., An, F., Su, P.: A quantum-PSO algorithm for no-wait flow shop scheduling problem. In: Chinese Control and Decision Conference (CCDC), pp. 179\u2013184 (2010)","DOI":"10.1109\/CCDC.2010.5499096"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Tasgetiren, M.F., Sevkli, M., Liang, Y.C., et al.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of IEEE Congress on Evolutionary Computation, vol. 2, pp. 1412\u20131419. IEEE, Washington, D.C. (2004)","DOI":"10.1109\/CEC.2004.1331062"},{"issue":"5","key":"38_CR14","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.chaos.2006.05.082","volume":"35","author":"B Liiu","year":"2008","unstructured":"Liiu, B., Wang, L., Jiny, I.: An Effective Hybrid PSO-based Algorithm for Flow Shop Scheduling to Minimize Makespan. Chaos, Solitions & Fractals 35(5), 851\u2013861 (2008)","journal-title":"Chaos, Solitions & Fractals"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-13495-1_18","volume-title":"Advances in Swarm Intelligence","author":"X Wang","year":"2010","unstructured":"Wang, X., Tang, L.: An improved particle swarm optimization for permutation flowshop scheduling problem with total flowtime criterion. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010, Part I. LNCS, vol. 6145, pp. 144\u2013151. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Human Centered Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15554-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T17:20:31Z","timestamp":1747761631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15554-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155531","9783319155548"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15554-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}