{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:05:27Z","timestamp":1767319527989,"version":"3.48.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091550","type":"print"},{"value":"9783032091567","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-09156-7_19","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:02:20Z","timestamp":1767319340000},"page":"281-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SchedulExpert: Graph Attention Meets Mixture-of-Experts for\u00a0JSSP"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Abgaryan","sequence":"first","affiliation":[]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[]},{"given":"Ararat","family":"Harutyunyan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"19_CR1","unstructured":"Abgaryan, H., Harutyunyan, A., Cazenave, T.: Llms can schedule (2024). https:\/\/arxiv.org\/abs\/2408.06993"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Abgaryan, H., Harutyunyan, A., Cazenave, T.: Randomized greedy sampling for jssp. In: Proceedings of the 18th Learning and Intelligent Optimization Conference (LION 18). Lecture Notes in Computer Science, vol. 14990, pp. 1\u201312. Springer, Heidelberg (2025)","DOI":"10.1007\/978-3-031-75623-8_1"},{"key":"19_CR3","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning (2017)"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003). https:\/\/doi.org\/10.1145\/937503.937505","journal-title":"ACM Comput. Surv."},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Bonetta, G., Zago, D., Cancelliere, R., Grosso, A.: Job shop scheduling via deep reinforcement learning: a sequence to sequence approach. In: Learning and Intelligent Optimization, pp. 475\u2013490. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-44505-7_32","DOI":"10.1007\/978-3-031-44505-7_32"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B.: A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012). https:\/\/doi.org\/10.1109\/TCIAIG.2012.2186810","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cai, W., Jiang, J., Wang, F., Tang, J., Kim, S., Huang, J.: A survey on mixture of experts. arXiv preprint arXiv:2407.06204 (2024)","DOI":"10.36227\/techrxiv.172055626.64129172\/v1"},{"key":"19_CR8","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Proceedings of the IJCAI International Joint Conference on Artificial Intelligence, pp. 456\u2013461 (2009)"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Cebi, C., Atac, E., Sahingoz, O.K.: Job shop scheduling problem and solution algorithms: a review. In: 2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp.\u00a01\u20137 (2020). https:\/\/doi.org\/10.1109\/ICCCNT49239.2020.9225581","DOI":"10.1109\/ICCCNT49239.2020.9225581"},{"key":"19_CR10","unstructured":"Chaudhry, S.A., Khan, S.: Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study. ResearchGate (2015)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms, part ii: Hybrid genetic search strategies. Comput. Ind. Eng. 36(2), 343\u2013364 (1999)","DOI":"10.1016\/S0360-8352(99)00136-9"},{"key":"19_CR12","unstructured":"Corsini, A., Porrello, A., Calderara, S., Dell\u2019Amico, M.: Self-labeling the job shop scheduling problem. In: Advances in Neural Information Processing Systems, vol. 37 (NeurIPS 2024) (2024). https:\/\/arxiv.org\/abs\/2401.11849"},{"key":"19_CR13","unstructured":"Dasagi, V., Bruce, J., Peynot, T., Leitner, J.: Ctrl-z: recovering from instability in reinforcement learning. CoRR arxiv:1910.03732 (2019)"},{"key":"19_CR14","unstructured":"Drakulic, D., Michel, S., Mai, F., Sors, A., Andreoli, J.M.: BQ-NCO: bisimulation quotienting for efficient neural combinatorial optimization. In: Advances in Neural Information Processing Systems, vol. 37 (NeurIPS 2023) (2023). https:\/\/arxiv.org\/abs\/2301.03313"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Ettrich, R., Huber, M., Raidl, G.: A policy-based learning beam search for combinatorial optimization, pp. 130\u2013145. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30035-6_9","DOI":"10.1007\/978-3-031-30035-6_9"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Falkner, J.K., Thyssens, D., Bdeir, A., Schmidt-Thieme, L.: Learning to control local search for combinatorial optimization. In: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML\/PKDD) (2022)","DOI":"10.1007\/978-3-031-26419-1_22"},{"issue":"2","key":"19_CR17","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":"19_CR18","doi-asserted-by":"crossref","unstructured":"Ibrahim, S., Chen, W., Hazimeh, H., Ponomareva, N., Zhao, Z., Mazumder, R.: Comet: learning cardinality constrained mixture of experts with trees and local search. arXiv preprint arXiv:2306.02824 (2023)","DOI":"10.1145\/3580305.3599278"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Iklassov, Z., Medvedev, D., Solozabal Ochoa\u00a0de Retana, R., Takac, M.: On the study of curriculum learning for inferring dispatching policies on the job shop scheduling. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (2023)","DOI":"10.24963\/ijcai.2023\/594"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"WY Ku","year":"2016","unstructured":"Ku, W.Y., Beck, J.C.: Mixed integer programming models for job shop scheduling: a computational analysis. Comput. Oper. Res. 73, 42\u201353 (2016)","journal-title":"Comput. Oper. Res."},{"key":"19_CR21","unstructured":"Li, Y., Gu, Q.: Towards understanding the mixture-of-experts layer in deep learning. In: Advances in Neural Information Processing Systems (NeurIPS) (2022). https:\/\/arxiv.org\/abs\/2208.02813"},{"issue":"7","key":"19_CR22","doi-asserted-by":"publisher","first-page":"4276","DOI":"10.1109\/TII.2019.2908210","volume":"15","author":"CC Lin","year":"2019","unstructured":"Lin, C.C., Deng, D.J., Chih, Y.L., Chiu, H.T.: Smart manufacturing scheduling with edge computing using multiclass deep q network. IEEE Trans. Ind. Inf. 15(7), 4276\u20134284 (2019). https:\/\/doi.org\/10.1109\/TII.2019.2908210","journal-title":"IEEE Trans. Ind. Inf."},{"key":"19_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105400","journal-title":"Comput. Oper. Res."},{"key":"19_CR24","unstructured":"Nikishin, E., et al.: Improving stability in deep reinforcement learning with weight averaging. In: Proceedings of the 34th Conference on Uncertainty in Artificial Intelligence (UAI) Workshop on Uncertainty in Deep Learning (2018). https:\/\/www.gatsby.ucl.ac.uk\/~balaji\/udl-camera-ready\/UDL-24.pdf"},{"issue":"6","key":"19_CR25","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 797\u2013813 (1996)","journal-title":"Manag. Sci."},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. J. Sched. 8, 145\u2013159 (2005). https:\/\/doi.org\/10.1007\/s10951-005-6364-5","journal-title":"J. Sched."},{"key":"19_CR27","unstructured":"Ouali, Y., Hudelot, C., Tami, M.: An overview of deep semi-supervised learning (2020). https:\/\/arxiv.org\/abs\/2006.05278"},{"key":"19_CR28","unstructured":"Park, J., Bakhtiyarov, S., Park, J.: Schedulenet: Learn to solve multiagent scheduling problems with reinforcement learning (2022)"},{"key":"19_CR29","unstructured":"Perron, L., Furnon, V.: Or-tools. https:\/\/developers.google.com\/optimization\/"},{"key":"19_CR30","doi-asserted-by":"publisher","unstructured":"Pirnay, J., Grimm, D.G.: Take a step and reconsider: sequence decoding for self-improved neural combinatorial optimization. In: Proceedings of the 27th European Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, vol.\u00a0392, pp. 1927\u20131934. IOS Press (2024). https:\/\/doi.org\/10.3233\/FAIA240707. https:\/\/arxiv.org\/abs\/2407.17206","DOI":"10.3233\/FAIA240707"},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","volume":"77","author":"DA Rossit","year":"2018","unstructured":"Rossit, D.A., Tohm\u00e9, F., Frutos, M.: The non-permutation flow-shop scheduling problem: a literature review. Omega 77, 143\u2013153 (2018). https:\/\/doi.org\/10.1016\/j.omega.2017.05.010","journal-title":"Omega"},{"key":"19_CR32","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"issue":"2","key":"19_CR33","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":"19_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.107969","volume":"190","author":"L Wang","year":"2021","unstructured":"Wang, L., et al.: Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning. Comput. Netw. 190, 107969 (2021). https:\/\/doi.org\/10.1016\/j.comnet.2021.107969","journal-title":"Comput. Netw."},{"key":"19_CR35","unstructured":"Willi, T., Obando-Ceron, J., Foerster, J., Dziugaite, K., Castro, P.S.: Mixture of experts in a mixture of rl settings. arXiv preprint arXiv:2406.18420 (2024)"},{"key":"19_CR36","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: International Conference on Learning Representations (ICLR) (2019)"},{"key":"19_CR37","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.asoc.2023.110436"},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Zahmani, M.H., Atmani, B., Bekrar, A., Aissani, N.: Multiple priority dispatching rules for the job shop scheduling problem. In: 3rd International Conference on Control, Engineering Information Technology (CEIT\u20192015), Tlemcen, Algeria (2015). https:\/\/doi.org\/10.1109\/CEIT.2015.7232991","DOI":"10.1109\/CEIT.2015.7232991"},{"key":"19_CR39","unstructured":"Zhang, C., Cao, Z., Song, W., Wu, Y., Zhang, J.: Deep reinforcement learning guided improvement heuristic for job shop scheduling. In: International Conference on Learning Representations (ICLR) (2024)"},{"key":"19_CR40","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P.S., Xu, C.: Learning to dispatch for job shop scheduling via deep reinforcement learning. In: 34th Conference on Neural Information Processing Systems (NeurIPS) (2020)"}],"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-032-09156-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:02:23Z","timestamp":1767319343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09156-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032091550","9783032091567"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09156-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"15 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2025","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":"lion2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion19.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}