{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T14:53:15Z","timestamp":1776696795592,"version":"3.51.2"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031605963","type":"print"},{"value":"9783031605970","type":"electronic"}],"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-3-031-60597-0_21","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"329-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning to\u00a0Solve Job Shop Scheduling Under Uncertainty"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Infantes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phanie","family":"Roussel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Jacquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Benazera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"21_CR1","unstructured":"Beck, J., Wilson, N.: Proactive algorithms for scheduling with probabilistic durations. In: IJCAI International Joint Conference on Artificial Intelligence, pp. 1201\u20131206 (2005)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. 8, 239\u2013287 (2009)","journal-title":"Nat. Comput."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Boukedroun, M., Duvivier, D., Ait-el Cadi, A., Poirriez, V., Abbas, M.: A hybrid genetic algorithm for stochastic job-shop scheduling problems. RAIRO: Operations Research (2804-7303) 57(4) (2023)","DOI":"10.1051\/ro\/2023067"},{"key":"21_CR4","unstructured":"Brody, S., Alon, U., Yahav, E.: How attentive are graph attention networks? CoRR abs\/2105.14491 (2021). https:\/\/arxiv.org\/abs\/2105.14491"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Da Col, G., Teppan, E.C.: Industrial-size job shop scheduling with constraint programming. Oper. Res. Perspect. 9, 100249 (2022). https:\/\/doi.org\/10.1016\/j.orp.2022.100249, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2214716022000215","DOI":"10.1016\/j.orp.2022.100249"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"186474","DOI":"10.1109\/ACCESS.2020.3029868","volume":"8","author":"BA Han","year":"2020","unstructured":"Han, B.A., Yang, J.J.: Research on adaptive job shop scheduling problems based on dueling double DQN. IEEE Access 8, 186474\u2013186495 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3029868","journal-title":"IEEE Access"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Huang, S., Onta\u00f1\u00f3n, S.: A closer look at invalid action masking in policy gradient algorithms. In: The International FLAIRS Conference Proceedings, vol. 35 (2022). https:\/\/doi.org\/10.32473\/flairs.v35i.130584","DOI":"10.32473\/flairs.v35i.130584"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Iklassov, Z., Medvedev, D., de\u00a0Retana, R.S.O., Tak\u00e1c, M.: On the study of curriculum learning for inferring dispatching policies on the job shop scheduling. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 5350\u20135358. ijcai.org (2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/594","DOI":"10.24963\/ijcai.2023\/594"},{"key":"21_CR9","unstructured":"Kwon, Y.D., Choo, J., Yoon, I., Park, M., Park, D., Gwon, Y.: Matrix encoding networks for neural combinatorial optimization. In: 35th Conference on Neural Information Processing Systems (NEURIPS) (2021)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM\/ILOG. Constraints 23, 210\u2013250 (2018)","journal-title":"Constraints"},{"key":"21_CR11","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). https:\/\/doi.org\/10.1109\/ACCESS.2020.2987820","journal-title":"IEEE Access"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Liu, C.L., Huang, T.H.: Dynamic job-shop scheduling problems using graph neural network and deep reinforcement learning. IEEE Trans. Syst. Man, Cybern. Syst. (2023)","DOI":"10.1109\/TSMC.2023.3287655"},{"key":"21_CR13","unstructured":"LocalSolver: Stochastic job shop shceduling problems (2023). https:\/\/www.localsolver.com\/docs\/last\/exampletour\/stochastic-job-shop-scheduling-problem.html"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Lou, P., Liu, Q., Zhou, Z., Wang, H., Sun, S.X.: Multi-agent-based proactive-reactive scheduling for a job shop. Int. J. Adv. Manuf. Technol. 59, 311\u2013324 (2012). https:\/\/link.springer.com\/article\/10.1007\/s00170-011-3482-4","DOI":"10.1007\/s00170-011-3482-4"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/70.760354","volume":"15","author":"P Luh","year":"1999","unstructured":"Luh, P., Chen, D., Thakur, L.: An effective approach for job-shop scheduling with uncertain processing requirements. IEEE Trans. Robot. Autom. 15(2), 328\u2013339 (1999). https:\/\/doi.org\/10.1109\/70.760354","journal-title":"IEEE Trans. Robot. Autom."},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Park, J., Chun, J., Kim, S.H., Kim, Y., Park, J.: Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning. Int. J. Prod. Res. 59(11), 3360\u20133377 (2021). https:\/\/doi.org\/10.1080\/00207543.2020.1870013","DOI":"10.1080\/00207543.2020.1870013"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Raheja, A.S., Subramaniam, V.: Reactive recovery of job shop schedules - a review. Int. J. Adv. Manuf. Technol. 19, 756\u2013763 (2002). https:\/\/link.springer.com\/article\/10.1007\/s001700200087","DOI":"10.1007\/s001700200087"},{"key":"21_CR18","unstructured":"Roy, B., Sussmann, B.: Les problemes d\u2019ordonnancement avec contraintes disjonctives. Note ds 9 (1964)"},{"key":"21_CR19","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms (2017)"},{"issue":"15","key":"21_CR20","doi-asserted-by":"publisher","first-page":"4255","DOI":"10.1080\/00207543.2011.611539","volume":"50","author":"V Sels","year":"2012","unstructured":"Sels, V., Gheysen, N., Vanhoucke, M.: A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions. Int. J. Prod. Res. 50(15), 4255\u20134270 (2012)","journal-title":"Int. J. Prod. Res."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1007\/s00500-015-1647-z","volume":"20","author":"J Shen","year":"2016","unstructured":"Shen, J., Zhu, Y.: Chance-constrained model for uncertain job shop scheduling problem. Soft. Comput. 20, 2383\u20132391 (2016). https:\/\/doi.org\/10.1007\/s00500-015-1647-z","journal-title":"Soft. Comput."},{"issue":"2","key":"21_CR22","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","volume":"19","author":"W Song","year":"2023","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 (2023). https:\/\/doi.org\/10.1109\/TII.2022.3189725","journal-title":"IEEE Trans. Industr. Inf."},{"issue":"2","key":"21_CR23","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":"21_CR24","unstructured":"Wang, M., et al.: Deep graph library: towards efficient and scalable deep learning on graphs. CoRR abs\/1909.01315 (2019), http:\/\/arxiv.org\/abs\/1909.01315"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Xiong, H., Shi, S., Ren, D., Hu, J.: A survey of job shop scheduling problem: the types and models. Comput. Oper. Res. 142, 105731 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105731, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054822000338","DOI":"10.1016\/j.cor.2022.105731"},{"key":"21_CR26","doi-asserted-by":"publisher","unstructured":"Xiong, H., Shi, S., Ren, D., Hu, J.: A survey of job shop scheduling problem: the types and models. Comput. Oper. Res. 142 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105731, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054822000338","DOI":"10.1016\/j.cor.2022.105731"},{"key":"21_CR27","unstructured":"Zeng, Y., Liao, Z., Dai, Y., Wang, R., Li, X., Yuan, B.: Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism (2022)"},{"key":"21_CR28","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. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol.\u00a033, pp. 1621\u20131632. Curran Associates, Inc. (2020). https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/11958dfee29b6709f48a9ba0387a2431-Paper.pdf"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60597-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:06:52Z","timestamp":1716818812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","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":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}