{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:25:19Z","timestamp":1743099919357,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_20","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"279-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Estimation of the Expected Makespan of a POS Under Duration Uncertainty"],"prefix":"10.1007","author":[{"given":"Michele","family":"Lombardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessio","family":"Bonfietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michela","family":"Milano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-319-07046-9_15","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"A Bonfietti","year":"2014","unstructured":"Bonfietti, A., Lombardi, M., Milano, M.: Disregarding duration uncertainty in partial order schedules? yes, we can!. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 210\u2013225. Springer, Heidelberg (2014)"},{"key":"20_CR3","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Iterative flattening: a scalable method for solving multi-capacity scheduling problems. In: AAAI\/IAAI, pp. 742\u2013747 (2000)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer Science & Business Media (2004)","DOI":"10.1007\/978-3-540-24777-7"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM Journal on Optimization 12(2), 479\u2013502 (2002)","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: Psplib-a project scheduling problem library: Or software-orsep operations research software exchange program. European Journal of Operational Research 96(1), 205\u2013216 (1997)","journal-title":"European Journal of Operational Research"},{"key":"20_CR7","unstructured":"Laborie, P.: Complete MCS-based search: application to resource constrained project scheduling. In: Proc. of IJCAI, pp. 181\u2013186. Professional Book Center (2005)"},{"key":"20_CR8","unstructured":"Laborie, P., Godard, D.: Self-adapting large neighborhood search: application to single-mode scheduling problems. In: Proc. of MISTA (2007)"},{"key":"20_CR9","unstructured":"Le Pape, C., Couronn\u00e9, P., Vergamini, D., Gosselin, V.: Time-versus-capacity compromises in project scheduling. AISB Quarterly, 19 (1995)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TC.2011.203","volume":"62","author":"M Lombardi","year":"2013","unstructured":"Lombardi, M., Milano, M., Benini, L.: Robust scheduling of task graphs under execution time uncertainty. IEEE Trans. Computers 62(1), 98\u2013111 (2013)","journal-title":"IEEE Trans. Computers"},{"key":"20_CR11","unstructured":"Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Proc. of IJCAI, pp. 494\u2013499. Morgan Kaufmann Publishers Inc. (2001)"},{"issue":"3","key":"20_CR12","first-page":"163","volume":"20","author":"N Policella","year":"2007","unstructured":"Policella, N., Cesta, A., Oddi, A., Smith, S.F.: From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling. AI Communications 20(3), 163\u2013180 (2007)","journal-title":"AI Communications"},{"key":"20_CR13","unstructured":"Policella, N., Smith, S.F., Cesta, A., Oddi, A.: Generating robust schedules through temporal flexibility. In: Proc. of ICAPS, pp. 209\u2013218 (2004)"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"SA Tarim","year":"2006","unstructured":"Tarim, S.A., Manandhar, S., Walsh, T.: Stochastic constraint programming: A scenario-based approach. Constraints 11(1), 53\u201380 (2006)","journal-title":"Constraints"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/095281399146607","volume":"11","author":"T Vidal","year":"1999","unstructured":"Vidal, T.: Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental & Theoretical Artificial Intelligence 11(1), 23\u201345 (1999)","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:01:30Z","timestamp":1676966490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}