{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T10:05:24Z","timestamp":1780653924382,"version":"3.54.1"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091918","type":"print"},{"value":"9783032091925","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-09192-5_10","type":"book-chapter","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T23:33:38Z","timestamp":1767310418000},"page":"142-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Bias Generalized Rollout Policy Adaptation on\u00a0the\u00a0Flexible Job-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Lotfi","family":"Kobrosly","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc-Emmanuel","family":"Coupvent des Graviers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christophe","family":"Guettier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"10_CR1","unstructured":"Abgaryan, H., Harutyunyan, A., Cazenave, T.: Randomized greedy sampling for jssp. In: Proceedings of LION 18, the 18th Learning and Intelligent Optimization Conference, pp. 9\u201319 (2024)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.asoc.2018.11.015","volume":"75","author":"F Amiri","year":"2019","unstructured":"Amiri, F., Shirazi, B., Tajdin, A.: Multi-objective simulation optimization for uncertain resource assignment and job sequence in automated flexible job shop. Appl. Soft Comput. 75, 190\u2013202 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2018.11.015","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.1100.0388","volume":"23","author":"JC Beck","year":"2011","unstructured":"Beck, J.C., Feng, T., Watson, J.P.: Combining constraint programming and local search for job-shop scheduling. INFORMS J. Comput. 23(1), 1\u201314 (2011)","journal-title":"INFORMS J. Comput."},{"key":"10_CR4","volume-title":"Test instances for the flexible job shop scheduling problem with work centers","author":"D Behnke","year":"2012","unstructured":"Behnke, D., Geiger, M.J.: Test instances for the flexible job shop scheduling problem with work centers. Arbeitspapier\/Research Paper\/Helmut-Schmidt-Universit\u00e4t, Lehrstuhl f\u00fcr Betriebswirtschaftslehre, insbes. Logistik-Management (2012)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bellman, R.: A markovian decision process. J. Math. Mech. pp. 679\u2013684 (1957)","DOI":"10.1512\/iumj.1957.6.56038"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10_CR7","first-page":"1","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI in games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI in games"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested monte-carlo search. In: Twenty-First International Joint Conference on Artificial Intelligence (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Generalized nested rollout policy adaptation. In: Monte Carlo Search: First Workshop, MCS 2020, Held in Conjunction with IJCAI 2020, Virtual Event, January 7, 2021, Proceedings 1, pp. 71\u201383. Springer (2021)","DOI":"10.1007\/978-3-030-89453-5_6"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Monte carlo game solver. In: Monte Carlo Search: First Workshop, MCS 2020, Held in Conjunction with IJCAI 2020, Virtual Event, January 7, 2021, Proceedings 1, pp. 56\u201370. Springer (2021)","DOI":"10.1007\/978-3-030-89453-5_5"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Cazenave, T.: Generalized nested rollout policy adaptation with limited repetitions. arXiv preprint arXiv:2401.10420 (2024).https:\/\/doi.org\/10.48550\/arXiv.2401.10420","DOI":"10.48550\/arXiv.2401.10420"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Learning a prior for monte CARLO search by replaying solutions to combinatorial problems. In: Parallel Problem Solving from Nature, PPSN 2024. Lecture Notes in Computer Science, vol. 15148, pp. 85\u201399. Springer (2024), https:\/\/doi.org\/10.1007\/978-3-031-70055-2_6","DOI":"10.1007\/978-3-031-70055-2_6"},{"key":"10_CR13","unstructured":"Cazenave, T., Lucas, J.Y., Kim, H., Triboulet, T.: Monte CARLO vehicle routing. In: ATT at ECAI 2020 (2020)"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"760","DOI":"10.3390\/pr10040760","volume":"10","author":"J Chang","year":"2022","unstructured":"Chang, J., Yu, D., Hu, Y., He, W., Yu, H.: Deep reinforcement learning for dynamic flexible job shop scheduling with random job arrival. Processes 10(4), 760 (2022). https:\/\/doi.org\/10.3390\/pr10040760","journal-title":"Processes"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"10_CR16","unstructured":"Clark, G.: Deep synoptic monte-carlo planning in reconnaissance blind chess. In: Ranzato, M., Beygelzimer, A., Dauphin, Y., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems. vol.\u00a034, pp. 4106\u20134119. Curran Associates, Inc. (2021). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/file\/215a71a12769b056c3c32e7299f1c5ed-Paper.pdf"},{"key":"10_CR17","volume":"9","author":"G Da Col","year":"2022","unstructured":"Da Col, G., Teppan, E.C.: Industrial-size job shop scheduling with constraint programming. Oper. Res. Perspect. 9, 100249 (2022)","journal-title":"Oper. Res. Perspect."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Dang, C., Bazgan, C., Cazenave, T., Chopin, M., Wuillemin, P.: Warm-starting nested rollout policy adaptation with optimal stopping. In: Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, pp. 12381\u201312389. AAAI Press (2023). https:\/\/doi.org\/10.1609\/aaai.v37i10.26459","DOI":"10.1609\/aaai.v37i10.26459"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","volume":"314","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Ding, J., Shen, L., Tamssaouet, K.: The flexible job shop scheduling problem: a review. Eur. J. Oper. Res. 314(2), 409\u2013432 (2024)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"L De Giovanni","year":"2010","unstructured":"De Giovanni, L., Pezzella, F.: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur. J. Oper. Res. 200(2), 395\u2013408 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Fera, M., et\u00a0al.: Production scheduling approaches for operations management. InTech (2013)","DOI":"10.5772\/55431"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Graviers, M.E.C.d., Kobrosly, L., Guettier, C., Cazenave, T.: Updating lower and upper bounds for the job-shop scheduling problem test instances. arXiv preprint arXiv:2504.16106 (2025https:\/\/doi.org\/10.48550\/arXiv.2504.16106","DOI":"10.48550\/arXiv.2504.16106"},{"key":"10_CR23","unstructured":"Hameed, M.S.A., Schwung, A.: Reinforcement learning on job shop scheduling problems using graph networks. arXiv preprint arXiv:2009.03836 (2020)"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. Oper. Res. Spektrum 15, 205\u2013215 (1994)","DOI":"10.1007\/BF01719451"},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/TSM.2017.2758380","volume":"31","author":"T Jamrus","year":"2017","unstructured":"Jamrus, T., Chien, C.F., Gen, M., Sethanan, K.: Hybrid particle swarm optimization combined with genetic operators for flexible job-shop scheduling under uncertain processing time for semiconductor manufacturing. IEEE Trans. Semicond. Manuf. 31(1), 32\u201341 (2017). https:\/\/doi.org\/10.1109\/TSM.2017.2758380","journal-title":"IEEE Trans. Semicond. Manuf."},{"issue":"3\u20135","key":"10_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3\u20135), 245\u2013276 (2002)","journal-title":"Math. Comput. Simul."},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Karimi, S., Ardalan, Z., Naderi, B., Mohammadi, M.: Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm. Appl. math. modell\u00edng 41, 667\u2013682 (2017). https:\/\/doi.org\/10.1016\/j.apm.2016.09.022","DOI":"10.1016\/j.apm.2016.09.022"},{"issue":"11","key":"10_CR28","doi-asserted-by":"publisher","first-page":"4044","DOI":"10.1111\/poms.13501","volume":"30","author":"GA Kasapidis","year":"2021","unstructured":"Kasapidis, G.A., Paraskevopoulos, D.C., Repoussis, P.P., Tarantilis, C.D.: Flexible job shop scheduling problems with arbitrary precedence graphs. Prod. Oper. Manag. 30(11), 4044\u20134068 (2021)","journal-title":"Prod. Oper. Manag."},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1007\/s10489-023-05240-w","volume":"54","author":"M Kemmerling","year":"2024","unstructured":"Kemmerling, M., L\u00fctticke, D., Schmitt, R.H.: Beyond games: a systematic review of neural monte CARLO tree search applications. Appl. Intell. 54(1), 1020\u20131046 (2024). https:\/\/doi.org\/10.1007\/s10489-023-05240-w","journal-title":"Appl. Intell."},{"key":"10_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107211","volume":"155","author":"K Li","year":"2021","unstructured":"Li, K., Deng, Q., Zhang, L., Fan, Q., Gong, G., Ding, S.: An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput. Ind. Eng. 155, 107211 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"10_CR31","unstructured":"Li, Y.: Deep reinforcement learning: an overview. arXiv preprint arXiv:1701.07274 (2017)"},{"key":"10_CR32","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"},{"issue":"4","key":"10_CR33","first-page":"1531","volume":"10","author":"CL Lu","year":"2016","unstructured":"Lu, C.L., Chiu, S.Y., Wu, J., Chao, L.P.: Dynamic monte-CARLO tree search algorithm for multi-objective flexible job-shop scheduling problem. Appl. Math. 10(4), 1531\u20131539 (2016)","journal-title":"Appl. Math."},{"key":"10_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113721","volume":"160","author":"Q Luo","year":"2020","unstructured":"Luo, Q., Deng, Q., Gong, G., Zhang, L., Han, W., Li, K.: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers. Expert Syst. Appl. 160, 113721 (2020)","journal-title":"Expert Syst. Appl."},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Mastrolilli, M., Svensson, O.: Hardness of approximating flow and job shop scheduling problems. J. ACM 58(5) (2011). https:\/\/doi.org\/10.1145\/2027216.2027218","DOI":"10.1145\/2027216.2027218"},{"issue":"8","key":"10_CR36","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.3390\/pr9081391","volume":"9","author":"P Meilanitasari","year":"2021","unstructured":"Meilanitasari, P., Shin, S.J.: A review of prediction and optimization for sequence-driven scheduling in job shop flexible manufacturing systems. Processes 9(8), 1391 (2021). https:\/\/doi.org\/10.3390\/pr9081391","journal-title":"Processes"},{"key":"10_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"L Meng","year":"2020","unstructured":"Meng, L., Zhang, C., Ren, Y., Zhang, B., Lv, C.: Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput. Ind. Eng. 142, 106347 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10_CR38","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":"10_CR39","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)","journal-title":"J. Sched."},{"issue":"11","key":"10_CR40","doi-asserted-by":"publisher","first-page":"3360","DOI":"10.1080\/00207543.2020.1870013","volume":"59","author":"J Park","year":"2021","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)","journal-title":"Int. J. Prod. Res."},{"issue":"10","key":"10_CR41","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202\u20133212 (2008)","journal-title":"Comput. Oper. Res."},{"key":"10_CR42","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s00170-010-2986-7","volume":"54","author":"A Rajabinasab","year":"2011","unstructured":"Rajabinasab, A., Mansour, S.: Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach. Inter. J. Adv. Manufact. Technol. 54, 1091\u20131107 (2011). https:\/\/doi.org\/10.1007\/s00170-010-2986-7","journal-title":"Inter. J. Adv. Manufact. Technol."},{"key":"10_CR43","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for monte CARLO tree search. In: Ijcai. vol.\u00a02011, pp. 649\u2013654 (2011)"},{"issue":"2","key":"10_CR44","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s10696-021-09437-4","volume":"35","author":"M Saqlain","year":"2023","unstructured":"Saqlain, M., Ali, S., Lee, J.: A monte-CARLO tree search algorithm for the flexible job-shop scheduling in manufacturing systems. Flex. Serv. Manuf. J. 35(2), 548\u2013571 (2023)","journal-title":"Flex. Serv. Manuf. J."},{"key":"10_CR45","unstructured":"Sentuc, J., Cazenave, T., Lucas, J.Y.: Generalized nested rollout policy adaptation with dynamic bias for vehicle routing. arXiv preprint arXiv:2111.06928 (2021)"},{"key":"10_CR46","doi-asserted-by":"publisher","unstructured":"Sentuc, J., Ellouze, F., Lucas, J.Y., Cazenave, T.: Learning the bias weights for generalized nested rollout policy adaptation. In: International Conference on Learning and Intelligent Optimization, pp. 194\u2013207. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-44505-7_14","DOI":"10.1007\/978-3-031-44505-7_14"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Silver, D., et\u00a0al.: Mastering the game of go with deep neural networks and tree search. nature 529(7587), 484\u2013489 (2016)","DOI":"10.1038\/nature16961"},{"issue":"2","key":"10_CR48","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."},{"key":"10_CR49","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1613\/jair.5507","volume":"60","author":"T Vodopivec","year":"2017","unstructured":"Vodopivec, T., Samothrakis, S., Ster, B.: On monte CARLO tree search and reinforcement learning. J. Artif. Intell. Res. 60, 881\u2013936 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR50","doi-asserted-by":"publisher","unstructured":"Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8, 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/BF00992698","DOI":"10.1007\/BF00992698"},{"issue":"2","key":"10_CR51","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0004-3702(02)00363-6","volume":"143","author":"JP Watson","year":"2003","unstructured":"Watson, J.P., Beck, J., Howe, A.E., Whitley, L.: Problem difficulty for tabu search in job-shop scheduling. Artif. Intell. 143(2), 189\u2013217 (2003). https:\/\/doi.org\/10.1016\/S0004-3702(02)00363-6","journal-title":"Artif. Intell."},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Wu, T.Y., Wu, I.C., Liang, C.C.: Multi-objective flexible job shop scheduling problem based on monte-CARLO tree search. In: 2013 Conference on Technologies and Applications of Artificial Intelligence, pp. 73\u201378. IEEE (2013)","DOI":"10.1109\/TAAI.2013.27"},{"issue":"3","key":"10_CR53","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 collaborative Intell. Manufact. 1(3), 67\u201377 (2019)","journal-title":"IET collaborative Intell. Manufact."},{"key":"10_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-017-1882-7","volume":"18","author":"X Yang","year":"2017","unstructured":"Yang, X., Yoshizoe, K., Taneda, A., Tsuda, K.: RNA inverse folding using monte CARLO tree search. BMC Bioinformatics 18, 1\u201312 (2017). https:\/\/doi.org\/10.1186\/s12859-017-1882-7","journal-title":"BMC Bioinformatics"},{"key":"10_CR55","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."},{"key":"10_CR56","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling. IEEE Trans. Cybern. 51(4), 1797\u20131811 (2020)","DOI":"10.1109\/TCYB.2020.3024849"},{"key":"10_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-61551-2_97","volume-title":"Principles and Practice of Constraint Programming \u2014 CP96","author":"J Zhou","year":"1996","unstructured":"Zhou, J.: A constraint program for solving the job-shop problem. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 510\u2013524. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61551-2_97"},{"key":"10_CR58","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.procir.2020.05.163","volume":"93","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Zhang, L., Horn, B.K.: Deep reinforcement learning-based dynamic scheduling in smart manufacturing. Procedia Cirp 93, 383\u2013388 (2020)","journal-title":"Procedia Cirp"}],"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-09192-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T09:25:45Z","timestamp":1780651545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09192-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032091918","9783032091925"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09192-5_10","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"}}]}}