{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:05:56Z","timestamp":1780373156870,"version":"3.54.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032272416","type":"print"},{"value":"9783032272423","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-27242-3_12","type":"book-chapter","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:29:50Z","timestamp":1780370990000},"page":"191-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving the\u00a0Planning of\u00a0Stochastic Tasks with\u00a0Availability Windows Using Prediction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1056-3808","authenticated-orcid":false,"given":"Alexis","family":"Guigal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8542-1522","authenticated-orcid":false,"given":"Emmanuel","family":"Hyon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2482-5042","authenticated-orcid":false,"given":"Claire","family":"Hanen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Addis, B., Carello, G., Grosso, A., T\u00e0nfani, E.: Operating room scheduling and rescheduling: a rolling horizon approach. Flex. Serv. Manuf. J. (2016)","DOI":"10.1007\/s10696-015-9213-7"},{"key":"12_CR2","unstructured":"Benammar, N., Chr\u00e9tienne, P., Hyon, E., Jean-Marie, A.: Approches par horizon roulant pour un probl\u00e8me de planification stochastique. In: ROADEF (2020)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Caprara, A.: A 3\/4-approximation algorithm for multiple subset sum. J. Heuristics 9 (2003)","DOI":"10.1023\/A:1022584312032"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Crainic, T.: Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning. Comput. Oper. Res. 132 (2021)","DOI":"10.1016\/j.cor.2021.105308"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Dahl, G., Foldnes, N.: LP based heuristics for the multiple knapsack problem with assignment restrictions. Ann. Oper. Res., 91\u2013104 (2006)","DOI":"10.1007\/s10479-006-0048-1"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1009894503716","volume":"4","author":"M Dawande","year":"2000","unstructured":"Dawande, M., Kalagnanam, M., Keskinocak, M., Salman, F.S., Ravi, R.: Approximation algorithms for the multiple knapsack problem with assignment restrictions. J. Comb. Optim. 4(2), 171\u2013186 (2000)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ejor.2015.11.006","volume":"251","author":"GD DeYong","year":"2016","unstructured":"DeYong, G.D., Cattani, K.D.: Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling horizon scheduling system. Eur. J. Oper. Res. 251(1), 85\u201395 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fleszar, K.: A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows. Comput. Ind. Eng. 175 (2023)","DOI":"10.1016\/j.cie.2022.108849"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Fu, Y.: Heuristic\/meta-heuristic methods for restricted bin packing problem. J. Heurist. 26 (2020)","DOI":"10.1007\/s10732-020-09444-y"},{"issue":"14","key":"12_CR10","doi-asserted-by":"publisher","first-page":"5108","DOI":"10.1080\/00207543.2023.2283570","volume":"62","author":"DG Gioia","year":"2024","unstructured":"Gioia, D.G., Fadda, E., Brandimarte, P.: Rolling horizon policies for multi-stage stochastic assemble-to-order problems. Int. J. Prod. Res. 62(14), 5108\u20135126 (2024)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"12_CR11","first-page":"535","volume":"35","author":"J Hartman","year":"2006","unstructured":"Hartman, J., Perry, T.: Approximating the solution of a dynamic, stochastic multiple knapsack problem. Control. Cybern. 35(3), 535\u2013550 (2006)","journal-title":"Control. Cybern."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10479-008-0402-6","volume":"171","author":"PV Hentenryck","year":"2009","unstructured":"Hentenryck, P.V., Bent, R., Mercier, L., Vergados, Y.: Online stochastic reservation systems. Ann. Oper. Res. 171, 101\u2013127 (2009)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"A Kleywegt","year":"1998","unstructured":"Kleywegt, A., Papastavrou, J.: The dynamic and stochastic knapsack problem. Oper. Res. 46(1), 17\u201335 (1998)","journal-title":"Oper. Res."},{"issue":"3","key":"12_CR14","first-page":"48","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Liu, Q., et al.: Algorithms for the variable-sized bin packing problem with time windows. Comput. Ind. Eng. (2021)","DOI":"10.1016\/j.cie.2021.107175"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Meng-G\u00e9rard, J., Chr\u00e9tienne, P., Baptiste, P., Sourd, F.: On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups. Discret. Appl. Math. 156 (2009)","DOI":"10.1016\/j.dam.2009.02.018"},{"key":"12_CR17","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Sahin, F., Narayanan, A., Powell Robinson, E.: Rolling horizon planning in supply chains: review, implications and directions for future research. Int. J. Prod. Res. (2013)","DOI":"10.1080\/00207543.2013.775523"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Sam\u00e0, M., D\u2019Ariano, A., Pacciarelli, D.: Optimal aircraft traffic flow management at a terminal control area during disturbances. In: 15th EURO Working Group on Transportation (EWGT), pp. 460\u2013469 (2012)","DOI":"10.1016\/j.sbspro.2012.09.764"}],"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-032-27242-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T03:29:56Z","timestamp":1780370996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27242-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032272416","9783032272423"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27242-3_12","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":"1 June 2026","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":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"26 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2026\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}