{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:00:08Z","timestamp":1754154008745,"version":"3.41.2"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819699001"},{"type":"electronic","value":"9789819699018"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-9901-8_24","type":"book-chapter","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T07:58:33Z","timestamp":1753257513000},"page":"291-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collaborative Double DQN Hyper-Heuristic Evolutionary Algorithm for the Lot-Sizing and Scheduling Problem in Distributed Heterogeneous Hybrid Flow Shop"],"prefix":"10.1007","author":[{"given":"Jing-Wei","family":"Gao","sequence":"first","affiliation":[]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shao-Yi","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Xiang","sequence":"additional","affiliation":[]},{"given":"Shi-Gao","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ruiz, R., V\u00e1zquez-Rodr\u00edguez, J.A.: The hybrid flow shop scheduling problem. Europ. J. Oper. Res. 205(1), 1\u201318 (2010)","key":"24_CR1","DOI":"10.1016\/j.ejor.2009.09.024"},{"doi-asserted-by":"crossref","unstructured":"Zhang, B., Pan, Q., Gao, L., et al.: A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem. Comput. Indust. Eng. \u200b\u200b136\u200b\u200b, 325\u2013344 (2019)","key":"24_CR2","DOI":"10.1016\/j.cie.2019.07.036"},{"doi-asserted-by":"crossref","unstructured":"Ceschia, S., Di Gaspero, L., Schaerf, A.: Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming. Comput. Indust. Eng. \u200b\u200b114\u200b\u200b, 235\u2013243 (2017)","key":"24_CR3","DOI":"10.1016\/j.cie.2017.10.017"},{"doi-asserted-by":"crossref","unstructured":"James, R.J.W., Almada-Lobo, B.: Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics. Comput. Oper. Res. \u200b\u200b38\u200b\u200b(12), 1816\u20131825 (2011)","key":"24_CR4","DOI":"10.1016\/j.cor.2011.02.005"},{"doi-asserted-by":"crossref","unstructured":"Li, J., Tao, X., Jia, B., et al.: Efficient multi-objective algorithm for the lot-streaming hybrid flowshop with variable sub-lots. Swarm Evol. Comput. \u200b\u200b52\u200b\u200b, 100600 (2020)","key":"24_CR5","DOI":"10.1016\/j.swevo.2019.100600"},{"doi-asserted-by":"crossref","unstructured":"Qin, W., Zhuang, Z., Liu, Y., et al.: A two-stage ant colony algorithm for hybrid flow shop scheduling with lot sizing and calendar constraints in printed circuit board assembly. Comput. Indust. Eng. \u200b\u200b138\u200b\u200b, 106115 (2019)","key":"24_CR6","DOI":"10.1016\/j.cie.2019.106115"},{"doi-asserted-by":"crossref","unstructured":"Boctor, F.F.: Single-machine capacitated lot-sizing and scheduling with delivery dates and quantities. Int. J. Product. Res. \u200b\u200b60\u200b\u200b(24), 7345\u20137359 (2022)","key":"24_CR7","DOI":"10.1080\/00207543.2022.2036853"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., Li, F., Pan, Q.K., et al.: An artificial bee colony algorithm for the distributed hybrid flow-shop scheduling problem. Proc. Manufact. \u200b\u200b39\u200b\u200b, 1158\u20131166 (2019)","key":"24_CR8","DOI":"10.1016\/j.promfg.2020.01.354"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., Li, X., Gao, L., et al.: A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Int. J. Product. Res. \u200b\u200b59\u200b\u200b(13), 3880\u20133899 (2021)","key":"24_CR9","DOI":"10.1080\/00207543.2020.1753897"},{"doi-asserted-by":"crossref","unstructured":"Shao, W., Shao, Z., Pi, D.: Modelling and optimization of distributed heterogeneous hybrid flow shop lot-streaming scheduling problem. Expert Syst. Appl. \u200b\u200b214\u200b\u200b, 119151 (2023)","key":"24_CR10","DOI":"10.1016\/j.eswa.2022.119151"},{"doi-asserted-by":"crossref","unstructured":"Lin, C.C., Peng, Y.C., Chang, Y.S., et al.: Reentrant hybrid flow shop scheduling with stockers in automated material handling systems using deep reinforcement learning. Comput. Indust. Eng. \u200b\u200b189\u200b\u200b, 109995 (2024)","key":"24_CR11","DOI":"10.1016\/j.cie.2024.109995"},{"doi-asserted-by":"crossref","unstructured":"Wang, M., Zhang, J., Zhang, P., et al.: Independent double DQN-based multi-agent reinforcement learning approach for online two-stage hybrid flow shop scheduling with batch machines. J. Manufact. Syst. \u200b\u200b65\u200b\u200b, 694\u2013708 (2022)","key":"24_CR12","DOI":"10.1016\/j.jmsy.2022.11.001"},{"doi-asserted-by":"crossref","unstructured":"Zhao, F., Di, S., Wang, L., et al.: A self-learning hyper-heuristic for the distributed assembly blocking flow shop scheduling problem with total flowtime criterion. Eng. Appl. Artif. Intell. \u200b\u200b116\u200b\u200b, 105418 (2022)","key":"24_CR13","DOI":"10.1016\/j.engappai.2022.105418"},{"doi-asserted-by":"crossref","unstructured":"Song, H.B., Lin, J.: A genetic programming hyper-heuristic for the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times. Swarm and Evol. Comput. \u200b\u200b60\u200b\u200b, 100807 (2021)","key":"24_CR14","DOI":"10.1016\/j.swevo.2020.100807"},{"unstructured":"Montgomery, D.C.: Design and Analysis of Experiments. John Wiley & Sons (2017)","key":"24_CR15"},{"doi-asserted-by":"crossref","unstructured":"Shao, W., Shao, Z., Pi, D.: Lot sizing and scheduling problem in distributed heterogeneous hybrid flow shop and learning-driven iterated local search algorithm. IEEE Trans. Autom. Sci. Eng. (2023)","key":"24_CR16","DOI":"10.1109\/TASE.2023.3326301"},{"doi-asserted-by":"crossref","unstructured":"Zhang, B., Pan, Q.K., Meng, L.L., et al.: A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots. Appl. Soft Comput. \u200b\u200b106\u200b\u200b, 107305 (2021)","key":"24_CR17","DOI":"10.1016\/j.asoc.2021.107305"},{"doi-asserted-by":"crossref","unstructured":"Li, C., Zhang, B., Han, Y., et al.: Energy-efficient hybrid flowshop scheduling with consistent sublots using an improved cooperative coevolutionary algorithm. Mathematics \u200b\u200b11\u200b\u200b(1), 77 (2022)","key":"24_CR18","DOI":"10.3390\/math11010077"}],"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-96-9901-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T22:06:45Z","timestamp":1753308405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9901-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819699001","9789819699018"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9901-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 July 2025","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":"Ningbo","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/icg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}