{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T06:15:23Z","timestamp":1783923323483,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819234370","type":"print"},{"value":"9789819234387","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T00:00:00Z","timestamp":1783987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T00:00:00Z","timestamp":1783987200000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-3438-7_22","type":"book-chapter","created":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T05:44:51Z","timestamp":1783921491000},"page":"257-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph-Based Reinforcement Learning Method for Flexible Job Shop Scheduling with Sequence Flexibility"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0973-4008","authenticated-orcid":false,"given":"Guohao","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8789-4470","authenticated-orcid":false,"given":"Erdong","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0210-2273","authenticated-orcid":false,"given":"Liejun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7361-9283","authenticated-orcid":false,"given":"Shiji","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9382-6308","authenticated-orcid":false,"given":"Yuli","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8702-7603","authenticated-orcid":false,"given":"Xiuxian","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,14]]},"reference":[{"issue":"6","key":"22_CR1","doi-asserted-by":"publisher","first-page":"3518","DOI":"10.1109\/TCYB.2021.3128075","volume":"53","author":"I-B Park","year":"2021","unstructured":"Park, I.-B., Park, J.: Scalable scheduling of semiconductor packaging facilities using deep reinforcement learning. IEEE Trans. Cybern. 53(6), 3518\u20133531 (2021)","journal-title":"IEEE Trans. Cybern."},{"key":"22_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105020","volume":"123","author":"WT Lunardi","year":"2020","unstructured":"Lunardi, W.T., et al.: Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem. Comput. Oper. Res. 123, 105020 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1007\/s11590-013-0669-7","volume":"8","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., et al.: A MILP model for an extended version of the flexible job shop problem. Optim. Lett. 8(4), 1417\u20131431 (2014)","journal-title":"Optim. Lett."},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"J-q Li","year":"2010","unstructured":"Li, J.-q., Pan, Q.-k., Liang, Y.-C.: An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 59(4), 647\u2013662 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1109\/TASE.2023.3267714","volume":"22","author":"C Lin","year":"2023","unstructured":"Lin, C., Cao, Z.C., Zhou, M.C.: Autoencoder-embedded iterated local search for energy-minimized task schedules of human\u2013cyber\u2013physical systems. IEEE Trans. Autom. Sci. Eng. 22, 512\u2013522 (2023)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ejor.2020.12.021","volume":"293","author":"WT Lunardi","year":"2021","unstructured":"Lunardi, W.T., et al.: Metaheuristics for the online printing shop scheduling problem. Eur. J. Oper. Res. 293(2), 419\u2013441 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi, P., Mehrabad, M.S., Jolai, F.: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18(3), 331\u2013342 (2007)","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir, Y., K\u00fcr\u015fat \u0130\u015fleyen, S.: Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Model. 37(3), 977\u2013988 (2013)","journal-title":"Appl. Math. Model."},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoo.2021.0056","volume":"4","author":"B Naderi","year":"2022","unstructured":"Naderi, B., Roshanaei, V.: Critical-path-search logic-based benders decomposition approaches for flexible job shop scheduling. INFORMS J. Optim. 4(1), 1\u201328 (2022)","journal-title":"INFORMS J. Optim."},{"key":"22_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101538","volume":"86","author":"X Han","year":"2024","unstructured":"Han, X., et al.: A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV. Swarm Evol. Comput. 86, 101538 (2024)","journal-title":"Swarm Evol. Comput."},{"key":"22_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109209","volume":"180","author":"Y Yang","year":"2023","unstructured":"Yang, Y., et al.: Guided shuffled frog-leaping algorithm for flexible job shop scheduling problem with variable sublots and overlapping in operations. Comput. Ind. Eng. 180, 109209 (2023)","journal-title":"Comput. Ind. Eng."},{"key":"22_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108794","volume":"121","author":"S Mahmud","year":"2022","unstructured":"Mahmud, S., et al.: Swarm intelligent based metaheuristics for a bi-objective flexible job shop integrated supply chain scheduling problems. Appl. Soft Comput. 121, 108794 (2022)","journal-title":"Appl. Soft Comput."},{"issue":"7","key":"22_CR13","doi-asserted-by":"publisher","first-page":"4276","DOI":"10.1109\/TII.2019.2908210","volume":"15","author":"C-C Lin","year":"2019","unstructured":"Lin, C.-C., et al.: Smart manufacturing scheduling with edge computing using multiclass deep Q network. IEEE Trans. Industr. Inform. 15(7), 4276\u20134284 (2019)","journal-title":"IEEE Trans. Industr. Inform."},{"key":"22_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei, K., et al.: A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst. Appl. 205, 117796 (2022)","journal-title":"Expert Syst. Appl."},{"key":"22_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.123019","volume":"245","author":"E Yuan","year":"2024","unstructured":"Yuan, E., et al.: Solving flexible job shop scheduling problems via deep reinforcement learning. Expert Syst. Appl. 245, 123019 (2024)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MRA.2023.3265515","volume":"30","author":"LJ Zhou","year":"2023","unstructured":"Zhou, L.J., Lin, C.R., Cao, Z.C.: Reinforcement-learning-based local search approach to integrated order batching: driving growth for logistics and retail. IEEE Rob. Autom. Mag. 30(2), 34\u201345 (2023)","journal-title":"IEEE Rob. Autom. Mag."},{"issue":"11","key":"22_CR17","doi-asserted-by":"publisher","first-page":"6909","DOI":"10.1109\/TCYB.2024.3413054","volume":"54","author":"ZC Cao","year":"2024","unstructured":"Cao, Z.C., et al.: Learning-based genetic algorithm to schedule an extended flexible job shop. IEEE Trans. Cybern. 54(11), 6909\u20136920 (2024)","journal-title":"IEEE Trans. Cybern."}],"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-92-3438-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T05:44:51Z","timestamp":1783921491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3438-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,14]]},"ISBN":["9789819234370","9789819234387"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3438-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,14]]},"assertion":[{"value":"14 July 2026","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":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2026a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2026\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}