{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T16:45:49Z","timestamp":1790700349031,"version":"4.1.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,10,29]],"date-time":"2008-10-29T00:00:00Z","timestamp":1225238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10951-008-0091-7","type":"journal-article","created":{"date-parts":[[2008,10,28]],"date-time":"2008-10-28T19:36:13Z","timestamp":1225222573000},"page":"299-314","source":"Crossref","is-referenced-by-count":21,"title":["Solve-and-robustify"],"prefix":"10.1007","volume":"12","author":[{"given":"Nicola","family":"Policella","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amedeo","family":"Cesta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angelo","family":"Oddi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,10,29]]},"reference":[{"key":"91_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/0-387-27744-7_11","volume-title":"Multidisciplinary scheduling: theory and applications","author":"M. A. Aloulou","year":"2005","unstructured":"Aloulou, M. A., & Portmann, M. C. (2005). An efficient proactive-reactive scheduling approach to hedge against shop floor disturbances. In G. Kendall, E. Burke, S. Petrovic, & M. Gendreau (Eds.), Multidisciplinary scheduling: theory and applications (pp.\u00a0223\u2013246). New York: Springer."},{"issue":"2","key":"91_CR2","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ejor.2004.04.004","volume":"165","author":"C. Artigues","year":"2005","unstructured":"Artigues, C., Billaut, J. C., & Esswein, C. (2005). Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research, 165(2), 314\u2013328.","journal-title":"European Journal of Operational Research"},{"key":"91_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., Mohring, R. H., & Radermacher, F. J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16, 201\u2013240.","journal-title":"Annals of Operations Research"},{"key":"91_CR4","unstructured":"Cesta, A., & Oddi, A. (2001). Algorithms for dynamic management of temporal constraints networks (Tech. rep.). ISTC-CNR, Institute for Cognitive Science and Technology, Italian National Research Council."},{"key":"91_CR5","unstructured":"Cesta, A., Oddi, A., & Smith, S. F. (1998). Profile based algorithms to solve multiple capacitated metric scheduling problems. In Proceedings of the 4th international conference on artificial intelligence planning systems, AIPS-98 (pp.\u00a0214\u2013223)."},{"issue":"1","key":"91_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., & Smith, S. F. (2002). A\u00a0constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1), 109\u2013136.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"91_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0004-3702(87)90092-0","volume":"32","author":"D. Chapman","year":"1987","unstructured":"Chapman, D. (1987). Planning for conjuctive goals. Artificial Intelligence, 32(3), 333\u2013377.","journal-title":"Artificial Intelligence"},{"key":"91_CR8","first-page":"1086","volume-title":"Proceedings of the 12th national conference on artificial intelligence, AAAI-94","author":"C. Cheng","year":"1994","unstructured":"Cheng, C., & Smith, S. F. (1994). Generating feasible schedules under complex metric constraints. In Proceedings of the 12th national conference on artificial intelligence, AAAI-94 (pp.\u00a01086\u20131091). Menlo Park: AAAI Press."},{"issue":"5","key":"91_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/5254.722362","volume":"13","author":"S. A. Chien","year":"1998","unstructured":"Chien, S. A., Muscettola, N., Rajan, K., Smith, B. D., & Rabideau, G. (1998). Automated planning and scheduling for goal-based autonomous spacecraft. IEEE Intelligent Systems, 13(5), 50\u201355.","journal-title":"IEEE Intelligent Systems"},{"issue":"1","key":"91_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(91)90024-E","volume":"52","author":"K. Currie","year":"1991","unstructured":"Currie, K., & Tate, A. (1991). O-plan: The open planning architecture. Artificial Intelligence, 52(1), 49\u201386.","journal-title":"Artificial Intelligence"},{"key":"91_CR11","unstructured":"Do, M. B., & Kambhampati, S. (2003). Improving temporal flexibility of position constrained metric temporal plans. In Proceedings of the 13th international conference on automated planning & scheduling, ICAPS\u201903 (pp.\u00a042\u201351)."},{"key":"91_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M. Fox","year":"2003","unstructured":"Fox, M., & Long, D. (2003). PDDL2.1: An\u00a0extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20, 61\u2013124.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"91_CR13","unstructured":"Fox, M., Gerevini, A., Long, D., & Serina, I. (2006a). Plan stability: replanning versus plan repair. In Proceedings of the 16th international conference on automated planning and scheduling, ICAPS\u00a006 (pp.\u00a0212\u2013221)."},{"key":"91_CR14","unstructured":"Fox, M., Howey, R., & Long, D. (2006b). Exploration of the robustness of plans. In Proceedings of the 21st national conference on artificial intelligence, AAAI\u00a006 (pp.\u00a0834\u2013839)."},{"key":"91_CR15","unstructured":"Godard, D., Laborie, P., & Nuitjen, W. (2005). Randomized large neighborhood search for cumulative scheduling. In Proceedings of the 15th international conference on automated planning and scheduling, ICAPS 2005 (pp.\u00a081\u201389)."},{"issue":"1\u20132","key":"91_CR16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(94)00076-D","volume":"76","author":"S. Kambhampati","year":"1995","unstructured":"Kambhampati, S., Knoblock, C. A., & Yang, Q. (1995). Planning as refinement search: a\u00a0unified framework for evaluating design tradeoffs in partial order planning. Artificial Intelligence, 76(1\u20132), 167\u2013238.","journal-title":"Artificial Intelligence"},{"key":"91_CR17","first-page":"197","volume-title":"Project scheduling\u2014recent models, algorithms and applications","author":"R. Kolisch","year":"1998","unstructured":"Kolisch, R., Schwindt, C., & Sprecher, A. (1998). Benchmark instances for project scheduling problems. In J. Weglarz (Ed.), Project scheduling\u2014recent models, algorithms and applications (pp.\u00a0197\u2013212). Boston: Kluwer Academic."},{"key":"91_CR18","unstructured":"Laborie, P., & Ghallab, M. (1995). Planning with sharable resource constraints. In Proceedings of 14th international joint conference on artificial intelligence, IJCAI-95 (pp.\u00a01643\u20131651)."},{"key":"91_CR19","unstructured":"Laborie, P., & Godard, D. (2007). Self-adapting large neighborhood search: application to single-mode scheduling problems. In Proceedings of 3rd multidisciplinary international scheduling conference: theory and applications, MISTA-07."},{"issue":"7","key":"91_CR20","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1080\/07408170490447348","volume":"36","author":"R. Leus","year":"2004","unstructured":"Leus, R., & Herroelen, W. (2004). Stability and resource allocation in project planning. IIE Transactions, 36(7), 667\u2013682.","journal-title":"IIE Transactions"},{"key":"91_CR21","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-46135-3_10","volume-title":"Principles and practice of constraint programming, 8th\u00a0international conference, CP 2002","author":"N. Muscettola","year":"2002","unstructured":"Muscettola, N. (2002). Computing the envelope for stepwise-constant resource allocations. In Lecture notes in computer science: Vol.\u00a02470. Principles and practice of constraint programming, 8th\u00a0international conference, CP 2002 (pp.\u00a0139\u2013154). Berlin: Springer."},{"key":"91_CR22","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/978-3-540-30201-8_37","volume-title":"Principles and practice of constraint programming, 10th\u00a0international conference, CP 2004","author":"N. Policella","year":"2004","unstructured":"Policella, N., Oddi, A., Smith, S. F., & Cesta, A. (2004a). Generating robust partial order schedules. In M. Wallace (Ed.), Lecture notes in computer science : Vol.\u00a03258. Principles and practice of constraint programming, 10th\u00a0international conference, CP 2004 (pp.\u00a0496\u2013511). Berlin: Springer."},{"key":"91_CR23","unstructured":"Policella, N., Smith, S. F., Cesta, A., & Oddi, A. (2004b). Generating robust schedules through temporal flexibility. In Proceedings of the 14th international conference on automated planning & scheduling, ICAPS\u201904 (pp.\u00a0209\u2013218)."},{"key":"91_CR24","unstructured":"Policella, N., Wang, X., Smith, S. F., & Oddi, A. (2005). Exploiting temporal flexibility to obtain high quality schedules. In Proceedings of the twentieth national conference on artificial intelligence, AAAI-05 (pp.\u00a01199\u20131204)."},{"issue":"3","key":"91_CR25","first-page":"163","volume":"20","author":"N. Policella","year":"2007","unstructured":"Policella, N., Cesta, A., Oddi, A., & Smith, S. F. (2007). From precedence constraint posting to partial order schedules. AI Communications, 20(3), 163\u2013180.","journal-title":"AI Communications"},{"key":"91_CR26","unstructured":"Rasconi, R., Cesta, A., & Policella, N. (2008). Validating scheduling approaches against executional uncertainty. Journal of Intelligent Manufacturing (in\u00a0press)."},{"key":"91_CR27","first-page":"219","volume-title":"Handbook of metaheuristics","author":"M. Resende","year":"2002","unstructured":"Resende, M., & Ribeiro, C. (2002). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp.\u00a0219\u2013249). Dordrecht: Kluwer Academic."},{"key":"91_CR28","first-page":"139","volume-title":"Proceedings of the 11th national conference on artificial intelligence, AAAI-93","author":"S. F. Smith","year":"1993","unstructured":"Smith, S. F., & Cheng, C. (1993). Slack-based heuristics for constraint satisfactions scheduling. In Proceedings of the 11th national conference on artificial intelligence, AAAI-93 (pp.\u00a0139\u2013144). Menlo Park: AAAI Press."},{"issue":"1","key":"91_CR29","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.47.1.113","volume":"47","author":"S. D. Wu","year":"1999","unstructured":"Wu, S. D., Beyon, E. S., & Storer, R. H. (1999). A\u00a0graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Operations Research, 47(1), 113\u2013124.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0091-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0091-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0091-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:42Z","timestamp":1559468382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0091-7"}},"subtitle":["Synthesizing partial order schedules by chaining"],"short-title":[],"issued":{"date-parts":[[2008,10,29]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["91"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0091-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,29]]}}}