{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:58:23Z","timestamp":1743119903811,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819755806"},{"type":"electronic","value":"9789819755813"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-5581-3_24","type":"book-chapter","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T19:02:53Z","timestamp":1722538973000},"page":"295-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Genetic Algorithm Combining Tabu Search for Solving Flexible Job Shop Scheduling Problem with Transportation and Start-Stop Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6696-1263","authenticated-orcid":false,"given":"Yifan","family":"Gu","sequence":"first","affiliation":[]},{"given":"Hua","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jinfeng","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Xie, J., Li, X., Gao, L., Gui, L.: A hybrid algorithm with a new neighborhood structure for job shop scheduling problems. Comput. Indust. Eng.\u00a0169 (2022)","DOI":"10.1016\/j.cie.2022.108205"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"8013","DOI":"10.1109\/TCYB.2023.3280175","volume":"53","author":"R Li","year":"2023","unstructured":"Li, R., Gong, W., Wang, L., Lu, C., Zhuang, X.: Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling. IEEE Trans. Cybernet. 53, 8013\u20138023 (2023)","journal-title":"IEEE Trans. Cybernet."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TEVC.2013.2260862","volume":"18","author":"M Gong","year":"2014","unstructured":"Gong, M., Cai, Q., Chen, X., Ma, L.: Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition. IEEE Trans. Evol. Comput. 18, 82\u201397 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/TCYB.2020.2971638","volume":"52","author":"S Liu","year":"2022","unstructured":"Liu, S., et al.: A self-guided reference vector strategy for many-objective optimization. IEEE Trans. Cybernet. 52, 1164\u20131178 (2022)","journal-title":"IEEE Trans. Cybernet."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Zhu, K.K., et al.: Dynamic distributed flexible job-shop scheduling problem considering operation inspection. Expert Syst. Appli. 224 (2023)","DOI":"10.1016\/j.eswa.2023.119840"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Lu, C., Gao, L., Gong, W.Y., Hu, C.Y., Yan, X.S., Li, X.Y.: Sustainable scheduling of distributed permutation flow-shop with non-identical factory using a knowledge-based multi-objective memetic optimization algorithm. Swarm Evolutionary Comput. 60 (2021)","DOI":"10.1016\/j.swevo.2020.100803"},{"key":"24_CR7","unstructured":"Li, R., Wang, L., Gong, W.: Knowledge-driven memetic algorithm for distributed green flexible job shop scheduling problem. J. Huazhong Univ. of Sci. & Tech 50, 55\u201360 (2022)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","volume":"59","author":"M Dai","year":"2019","unstructured":"Dai, M., Tang, D., Giret, A., Salido, M.A.: Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robot. Comput. Integrated Manufact. 59, 143\u2013157 (2019)","journal-title":"Robot. Comput. Integrated Manufact."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Luo, Q., Deng, Q., Gong, G., Zhang, L., Han, W., Li, K.: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers. Expert Syst. Appli. 160 (2020)","DOI":"10.1016\/j.eswa.2020.113721"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"CY Zhang","year":"2007","unstructured":"Zhang, C.Y., Li, P.G., Guan, Z.L., Rao, Y.Q.: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput. Oper. Res.Oper. Res. 34, 3229\u20133242 (2007)","journal-title":"Comput. Oper. Res.Oper. Res."}],"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-97-5581-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T19:16:05Z","timestamp":1722539765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5581-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819755806","9789819755813"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5581-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 August 2024","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":"Tianjin","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2024\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}