{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:26:43Z","timestamp":1743031603328,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819947546"},{"type":"electronic","value":"9789819947553"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-4755-3_14","type":"book-chapter","created":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T00:02:38Z","timestamp":1690675358000},"page":"156-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probability Learning Based Multi-objective Evolutionary Algorithm for Distributed No-Wait Flow-Shop and Vehicle Transportation Integrated Optimization Problem"],"prefix":"10.1007","author":[{"given":"Ziqi","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuocheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changsheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.cie.2019.02.041","volume":"130","author":"C Cheng","year":"2019","unstructured":"Cheng, C., Ying, K., Li, S., Hsieh, Y.: Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. Comput. Ind. Eng. 130, 338\u2013347 (2019)","journal-title":"Comput. Ind. Eng."},{"issue":"5-8","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00170-014-6177-9","volume":"75","author":"H Asefi","year":"2014","unstructured":"Asefi, H., Jolai, F., Rabiee, M., Tayebi Araghi, M.E.: A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flow-shop scheduling problem. Int. J. Adv. Manufact. Technol. 75(5\u20138), 1017\u20131033 (2014). https:\/\/doi.org\/10.1007\/s00170-014-6177-9","journal-title":"Int. J. Adv. Manufact. Technol."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cie.2018.05.030","volume":"121","author":"K Ying","year":"2018","unstructured":"Ying, K., Lin, S.: Minimizing makespan for no-wait flowshop scheduling problems with setup times. Comput. Ind. Eng. 121, 73\u201381 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"116921","DOI":"10.1016\/j.eswa.2022.116921","volume":"198","author":"N Zhu","year":"2022","unstructured":"Zhu, N., Zhao, F., Wang, L., Ding, R., Xu, T.: A discrete learning fruit fly algorithm based on knowledge for the distributed no-wait flow shop scheduling with due windows. Expert. Syst. Appl. 198, 116921 (2022)","journal-title":"Expert. Syst. Appl."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"107750","DOI":"10.1016\/j.asoc.2021.107750","volume":"112","author":"F Zhao","year":"2021","unstructured":"Zhao, F., Zhao, J., Wang, L., Tang, J.: An optimal block knowledge driven backtracking search algorithm for distributed assembly no-wait flow shop scheduling problem. Appl. Soft. Comput. 112, 107750 (2021)","journal-title":"Appl. Soft. Comput."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.asoc.2018.08.002","volume":"72","author":"O Engin","year":"2018","unstructured":"Engin, O., G\u00fc\u00e7l\u00fc, A.: A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Appl. Soft. Comput. 72, 166\u2013176 (2018)","journal-title":"Appl. Soft. Comput."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","volume":"137","author":"W Shao","year":"2017","unstructured":"Shao, W., Pi, D., Shao, Z.: Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms. Knowl. Based Syst. 137, 163\u2013181 (2017)","journal-title":"Knowl. Based Syst."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1016\/j.cor.2008.10.008","volume":"36","author":"Q Pan","year":"2009","unstructured":"Pan, Q., Wang, L., Qian, B.: A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Comput. Oper. Res. 36, 2498\u20132511 (2009)","journal-title":"Comput. Oper. Res."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"5072","DOI":"10.1016\/j.ins.2007.06.001","volume":"177","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., Mirzaei, A.H.: A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf. Sci. 177, 5072\u20135090 (2007)","journal-title":"Inf. Sci."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","volume":"16","author":"W Shao","year":"2019","unstructured":"Shao, W., Pi, D., Shao, Z.: A pareto-based estimation of distribution algorithm for solving multi-objective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time. IEEE Trans. Autom. Sci. Eng. 16, 1344\u20131360 (2019)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.cie.2017.09.009","volume":"113","author":"H Wang","year":"2017","unstructured":"Wang, H., Fu, Y., Huang, M., Huang, G.Q., Wang, J.: A NSGA-II based memetic algorithm for multi-objective parallel flowshop scheduling problem. Comput. Ind. Eng. 113, 185\u2013194 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00500-008-0352-6","volume":"13","author":"H Ishibuchi","year":"2009","unstructured":"Ishibuchi, H., Hitotsuyanagi, Y., Tsukamoto, N., Nojima, Y.: Use of biased neighborhood structures in multi-objective memetic algorithms. Soft Comput. 13, 795\u2013810 (2009)","journal-title":"Soft Comput."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: OEA\/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11, 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flow-shop scheduling. IEEE Trans. Syst. Man Cybern. Syst. Part C, Appl. Rev. 28, 392\u2013403 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst. Part C, Appl. Rev."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.ejor.2014.04.031","volume":"238","author":"A Allahverdi","year":"2014","unstructured":"Allahverdi, A., Aydilek, H.: Total completion time with makespan constraint in no-wait flowshops with setup times. Eur. J. Oper. Res. 238, 724\u2013734 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.knosys.2019.02.027","volume":"173","author":"ZC Li","year":"2019","unstructured":"Li, Z.C., Qian, B., Hu, R., Chang, L.L., Yang, J.B.: An elitist nondominated sorting hybrid algorithm for multi-objective flexible job-shop scheduling problem with sequence-dependent setups. Knowl. Based Syst. 173, 83\u2013112 (2019)","journal-title":"Knowl. Based Syst."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-4755-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T23:18:01Z","timestamp":1690931881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-4755-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819947546","9789819947553"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-4755-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2023a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2023\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}