{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:24:34Z","timestamp":1743063874298,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031756221"},{"type":"electronic","value":"9783031756238"}],"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-3-031-75623-8_11","type":"book-chapter","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T19:16:49Z","timestamp":1735845409000},"page":"138-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Assignment Scheduler: A New Behavioral Cloning Method for\u00a0the\u00a0Job-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6053-0589","authenticated-orcid":false,"given":"Imanol","family":"Echeverria","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7922-6771","authenticated-orcid":false,"given":"Maialen","family":"Murua","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0430-2255","authenticated-orcid":false,"given":"Roberto","family":"Santana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Behnke, M., Heafield, K.: Losing heads in the lottery: pruning transformer attention in neural machine translation. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 2664\u20132674 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.211"},{"key":"11_CR2","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"11_CR3","unstructured":"Brody, S., Alon, U., Yahav, E.: How attentive are graph attention networks? arXiv preprint arXiv:2105.14491 (2021)"},{"key":"11_CR4","unstructured":"Chen, K., Wang, J., Chen, L.C., Gao, H., Xu, W., Nevatia, R.: ABC-CNN: an attention based convolutional neural network for visual question answering. arXiv preprint arXiv:1511.05960 (2015)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TII.2022.3167380","volume":"19","author":"R Chen","year":"2022","unstructured":"Chen, R., Li, W., Yang, H.: A deep reinforcement learning framework based on an attention mechanism and disjunctive graph embedding for the job-shop scheduling problem. IEEE Trans. Industr. Inf. 19(2), 1322\u20131331 (2022)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"11_CR6","unstructured":"Chen, W., Khir, R., Van\u00a0Hentenryck, P.: Two-stage learning for the flexible job shop scheduling problem. arXiv preprint arXiv:2301.09703 (2023)"},{"key":"11_CR7","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-030-14347-3_34","volume-title":"Hybrid Intelligent Systems","author":"B Cunha","year":"2020","unstructured":"Cunha, B., Madureira, A.M., Fonseca, B., Coelho, D.: Deep reinforcement learning as a job shop scheduling solver: a literature review. In: Madureira, A.M., Abraham, A., Gandhi, N., Varela, M.L. (eds.) HIS 2018. AISC, vol. 923, pp. 350\u2013359. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-14347-3_34"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Da\u00a0Col, G., Teppan, E.: Google vs IBM: a constraint solving challenge on the job-shop scheduling problem. arXiv preprint arXiv:1909.08247 (2019)","DOI":"10.4204\/EPTCS.306.30"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-30048-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"G Da Col","year":"2019","unstructured":"Da Col, G., Teppan, E.C.: Industrial size job shop scheduling tackled by present day CP solvers. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 144\u2013160. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_9"},{"key":"11_CR10","unstructured":"Davis, L.: Job shop scheduling with genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp. 136\u2013140. Psychology Press (2014)"},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108487","volume":"171","author":"FM Defersha","year":"2022","unstructured":"Defersha, F.M., Obimuyiwa, D., Yimer, A.D.: Mathematical model and simulated annealing algorithm for setup operator constrained flexible job shop scheduling problem. Comput. Ind. Eng. 171, 108487 (2022)","journal-title":"Comput. Ind. Eng."},{"key":"11_CR12","unstructured":"Echeverria, I., Murua, M., Santana, R.: Solving large flexible job shop scheduling instances by generating a diverse set of scheduling policies with deep reinforcement learning. arXiv preprint arXiv:2310.15706 (2023)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Falkner, J.K., Thyssens, D., Bdeir, A., Schmidt-Thieme, L.: Learning to control local search for combinatorial optimization. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 361\u2013376. Springer (2022)","DOI":"10.1007\/978-3-031-26419-1_22"},{"key":"11_CR14","unstructured":"Fey, M., Lenssen, J.E.: Fast graph representation learning with PyTorch Geometric. In: ICLR Workshop on Representation Learning on Graphs and Manifolds (2019)"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1007\/s00170-004-2296-z","volume":"27","author":"AK Gupta","year":"2006","unstructured":"Gupta, A.K., Sivakumar, A.I.: Job shop scheduling techniques in semiconductor manufacturing. Int. J. Adv. Manuf. Technol. 27, 1163\u20131169 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Ho, K.H., et\u00a0al.: Residual scheduling: A new reinforcement learning approach to solving job shop scheduling problem. arXiv preprint arXiv:2309.15517 (2023)","DOI":"10.1109\/ACCESS.2024.3357969"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Hu, Z., Dong, Y., Wang, K., Sun, Y.: Heterogeneous graph transformer. In: Proceedings of the Web Conference 2020, pp. 2704\u20132710 (2020)","DOI":"10.1145\/3366423.3380027"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10951-017-0534-0","volume":"21","author":"H Ingimundardottir","year":"2018","unstructured":"Ingimundardottir, H., Runarsson, T.P.: Discovering dispatching rules from data using imitation learning: a case study for the job-shop problem. J. Sched. 21, 413\u2013428 (2018)","journal-title":"J. Sched."},{"key":"11_CR20","unstructured":"Kool, W., Van\u00a0Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Lee, J., Kee, S., Janakiram, M., Runger, G.: Attention-based reinforcement learning for combinatorial optimization: application to job shop scheduling problem. arXiv preprint arXiv:2401.16580 (2024)","DOI":"10.2139\/ssrn.4830118"},{"key":"11_CR22","unstructured":"Li, L., et al.: Learning to optimize permutation flow shop scheduling via graph-based imitation learning. arXiv preprint arXiv:2210.17178 (2022)"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"71752","DOI":"10.1109\/ACCESS.2020.2987820","volume":"8","author":"CL Liu","year":"2020","unstructured":"Liu, C.L., Chang, C.C., Tseng, C.J.: Actor-critic deep reinforcement learning for solving job shop scheduling problems. IEEE Access 8, 71752\u201371762 (2020)","journal-title":"IEEE Access"},{"key":"11_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107489","volume":"159","author":"S Luo","year":"2021","unstructured":"Luo, S., Zhang, L., Fan, Y.: Dynamic multi-objective scheduling for flexible job shop by deep reinforcement learning. Comput. Ind. Eng. 159, 107489 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.knosys.2016.09.001","volume":"112","author":"A Mart\u00ednez-Puras","year":"2016","unstructured":"Mart\u00ednez-Puras, A., Pacheco, J.: MOAMP-Tabu search and NSGA-II for a real bi-objective scheduling-routing problem. Knowl.-Based Syst. 112, 92\u2013104 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"11_CR26","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L., Tak\u00e1c, M.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"key":"11_CR27","unstructured":"Park, J., Bakhtiyar, S., Park, J.: Schedulenet: learn to solve multi-agent scheduling problems with reinforcement learning. arXiv preprint arXiv:2106.03051 (2021)"},{"issue":"3","key":"11_CR28","doi-asserted-by":"publisher","first-page":"311","DOI":"10.5267\/j.dsl.2021.2.006","volume":"10","author":"M Sharma","year":"2021","unstructured":"Sharma, M., Sharma, S.: An improved NEH heuristic to minimize makespan for flow shop scheduling problems. Decis. Sci. Lett. 10(3), 311\u2013322 (2021)","journal-title":"Decis. Sci. Lett."},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Shi, Y., Huang, Z., Feng, S., Zhong, H., Wang, W., Sun, Y.: Masked label prediction: unified message passing model for semi-supervised classification. arXiv preprint arXiv:2009.03509 (2020)","DOI":"10.24963\/ijcai.2021\/214"},{"issue":"2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","volume":"19","author":"W Song","year":"2022","unstructured":"Song, W., Chen, X., Li, Q., Cao, Z.: Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans. Industr. Inf. 19(2), 1600\u20131610 (2022)","journal-title":"IEEE Trans. Industr. Inf."},{"issue":"2","key":"11_CR31","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR32","unstructured":"Tassel, P., Gebser, M., Schekotihin, K.: A reinforcement learning environment for job-shop scheduling. arXiv preprint arXiv:2104.03760 (2021)"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Tassel, P., Gebser, M., Schekotihin, K.: An end-to-end reinforcement learning approach for job-shop scheduling problems based on constraint programming. arXiv preprint arXiv:2306.05747 (2023)","DOI":"10.1609\/icaps.v33i1.27243"},{"key":"11_CR34","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Wang, R., Wang, G., Sun, J., Deng, F., Chen, J.: Flexible job shop scheduling via dual attention network based reinforcement learning. arXiv preprint arXiv:2305.05119 (2023)","DOI":"10.1109\/TNNLS.2023.3306421"},{"issue":"3","key":"11_CR36","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","volume":"1","author":"J Xie","year":"2019","unstructured":"Xie, J., Gao, L., Peng, K., Li, X., Li, H.: Review on flexible job shop scheduling. IET Collab. Intell. Manuf. 1(3), 67\u201377 (2019)","journal-title":"IET Collab. Intell. Manuf."},{"key":"11_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110436","volume":"143","author":"E Yuan","year":"2023","unstructured":"Yuan, E., Cheng, S., Wang, L., Song, S., Wu, F.: Solving job shop scheduling problems via deep reinforcement learning. Appl. Soft Comput. 143, 110436 (2023)","journal-title":"Appl. Soft Comput."},{"key":"11_CR38","first-page":"1621","volume":"33","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P.S., Chi, X.: Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 1621\u20131632 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75623-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T09:09:34Z","timestamp":1741684174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75623-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031756221","9783031756238"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75623-8_11","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":"3 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"9 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lion18.unina.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}