{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:22:21Z","timestamp":1725549741802},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290414"},{"type":"electronic","value":"9783540317333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558590_16","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T12:53:11Z","timestamp":1128516791000},"page":"160-172","source":"Crossref","is-referenced-by-count":2,"title":["Schedule Robustness Through Broader Solve and Robustify Search for Partial Order Schedules"],"prefix":"10.1007","author":[{"given":"Nicola","family":"Policella","sequence":"first","affiliation":[]},{"given":"Amedeo","family":"Cesta","sequence":"additional","affiliation":[]},{"given":"Angelo","family":"Oddi","sequence":"additional","affiliation":[]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","first-page":"209","volume-title":"Proceedings of the 14 th International Conference on Automated Planning & Scheduling, ICAPS 2004","author":"N. Policella","year":"2004","unstructured":"Policella, N., Smith, S.F., Cesta, A., Oddi, A.: Generating Robust Schedules through Temporal Flexibility. In: Proceedings of the 14\n                    th\n                   International Conference on Automated Planning & Scheduling, ICAPS 2004, pp. 209\u2013218. AAAI Press, Menlo Park (2004)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-540-30201-8_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N. Policella","year":"2004","unstructured":"Policella, N., Oddi, A., Smith, S.F., Cesta, A.: Generating Robust Partial Order Schedules. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 496\u2013511. Springer, Heidelberg (2004)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0377-2217(99)00496-8","volume":"127","author":"C. Artigues","year":"2000","unstructured":"Artigues, C., Roubellat, F.: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. European Journal of Operational Research\u00a0127, 297\u2013316 (2000)","journal-title":"European Journal of Operational Research"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1080\/07408170490447348","volume":"36","author":"R. Leus","year":"2004","unstructured":"Leus, R., Herroelen, W.: Stability and Resource Allocation in Project Planning. IIE Transactions\u00a036, 667\u2013682 (2004)","journal-title":"IIE Transactions"},{"key":"16_CR5","unstructured":"Policella, N.: Scheduling with Uncertainty: a Proactive Approach using Partial Order Schedules. PhD thesis, University of Rome La Sapienza (2005)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Annals of Operations Research\u00a016, 201\u2013240 (1988)","journal-title":"Annals of Operations Research"},{"key":"16_CR7","unstructured":"Aloulou, M.A., Portmann, M.C.: An Efficient Proactive Reactive Scheduling Approach to Hedge against Shop Floor Disturbances. In: Proceedings of 1\n                    st\n                   Multidisciplinary International Conference on Scheduling: Theory and Applications, MISTA 2003, pp. 337\u2013362 (2003)"},{"key":"16_CR8","first-page":"214","volume-title":"Proceedings of the 4 th International Conference on Artificial Intelligence Planning Systems, AIPS 1998","author":"A. Cesta","year":"1998","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. In: Proceedings of the 4\n                    th\n                   International Conference on Artificial Intelligence Planning Systems, AIPS 1998, pp. 214\u2013223. AAAI Press, Menlo Park (1998)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: A Constraint-based method for Project Scheduling with Time Windows. Journal of Heuristics\u00a08, 109\u2013136 (2002)","journal-title":"Journal of Heuristics"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","volume":"46","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., Phan-Huy, T.: A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Science\u00a046, 1365\u20131384 (2000)","journal-title":"Management Science"},{"key":"16_CR11","unstructured":"Smith, T.B., Pyle, J.M.: An effective algorithm for project scheduling with arbitrary temporal constraints. In: Proceedings of the 19\n                    th\n                   National Conference on Artificial Intelligence, AAAI 2004, pp. 544\u2013549 (2004)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-30201-8_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"V.A. Cicirello","year":"2004","unstructured":"Cicirello, V.A., Smith, S.F.: Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 197\u2013211. Springer, Heidelberg (2004)"},{"key":"16_CR13","first-page":"308","volume-title":"Proceedings 14 th National Conference on Artificial Intelligence, AAAI 1997","author":"A. Oddi","year":"1997","unstructured":"Oddi, A., Smith, S.F.: Stochastic Procedures for Generating Feasible Schedules. In: Proceedings 14\n                    th\n                   National Conference on Artificial Intelligence, AAAI 1997, pp. 308\u2013314. AAAI Press, Menlo Park (1997)"},{"key":"16_CR14","first-page":"219","volume-title":"Handbook of Metaheuristics","author":"M. Resende","year":"2002","unstructured":"Resende, M., Ribeiro, C.: Greedy Randomized Adaptive Search Procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"16_CR15","unstructured":"Policella, N., Wang, X., Smith, S., Oddi, A.: Exploiting Temporal Flexibility to Obtain High Quality Schedules. In: Proceedings of the 20\n                    th\n                   National Conference on Artificial Intelligence, AAAI 2005. AAAI Press, Menlo Park (2005)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558590_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:49Z","timestamp":1619507389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558590_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290414","9783540317333"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11558590_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}