{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:59Z","timestamp":1725489359432},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73817-6_3","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T03:59:13Z","timestamp":1187409553000},"page":"48-62","source":"Crossref","is-referenced-by-count":0,"title":["A Constraint Model for State Transitions in Disjunctive Resources"],"prefix":"10.1007","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"3_CR2","first-page":"25","volume-title":"FLAIRS 2006","author":"R. Bart\u00e1k","year":"2006","unstructured":"Bart\u00e1k, R.: Incremental Propagation of Time Windows on Disjunctive Resources. In: FLAIRS 2006. Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference, pp. 25\u201330. AAAI Press, Stanford (2006)"},{"key":"3_CR3","first-page":"680","volume-title":"Proceedings of AAAI 1999","author":"J.C. Beck","year":"1999","unstructured":"Beck, J.C., Fox, M.S.: Scheduling Alternative Activities. In: Proceedings of AAAI 1999, pp. 680\u2013687. AAAI Press, USA (1999)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-63912-8_80","volume-title":"Recent Advances in AI Planning","author":"A. Cesta","year":"1997","unstructured":"Cesta, A., Stella, C.: A Time and Resource Problem for Planning Architectures. In: Steel, S. (ed.) ECP 1997. LNCS, vol.\u00a01348, pp. 117\u2013129. Springer, Heidelberg (1997)"},{"key":"3_CR5","unstructured":"Fages, F.: CLP versus LS on log-based reconciliation problems for nomadic applications. In: Proceedings of ERCIM\/CompulogNet Workshop on Constraints, Praha (2001)"},{"key":"3_CR6","volume-title":"Proceedings of AIPS 2000","author":"F. Focacci","year":"2000","unstructured":"Focacci, F., Laborie, P., Nuijten, W.: Solving Scheduling Problems with Setup Times and Alternative Resources. In: Proceedings of AIPS 2000, AAAI Press, Stanford (2000)"},{"key":"3_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P. Laborie","year":"2003","unstructured":"Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence\u00a0143, 151\u2013188 (2003)","journal-title":"Artificial Intelligence"},{"key":"3_CR9","unstructured":"Laborie, P.: Resource temporal networks: Definition and complexity. In: IJCAI 2003. Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 948\u2013953 (2003)"},{"key":"3_CR10","first-page":"1187","volume-title":"AAAI 2005","author":"M.D. Moffitt","year":"2005","unstructured":"Moffitt, M.D., Peintner, B., Pollack, M.E.: Augmenting Disjunctive Temporal Problems with Finite-Domain Constraints. In: AAAI 2005. Proceedings of the 20th National Conference on Artificial Intelligence, pp. 1187\u20131192. AAAI Press, Stanford (2005)"},{"key":"3_CR11","first-page":"248","volume-title":"AAAI 1998","author":"K. Stergiou","year":"1998","unstructured":"Stergiou, K., Koubarakis, M.: Backtracking algorithms for disjunctions of temporal constraints. In: AAAI 1998. Proceedings of the 15th National Conference on Artificial Intelligence, pp. 248\u2013253. AAAI Press, Stanford (1998)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1023\/A:1009736921890","volume":"2","author":"P.M. Pardalos","year":"1999","unstructured":"Pardalos, P.M., Qian, T., Resende, M.G.: A greedy randomized adaptive search procedure for the feedback vertex set problem. Journal of Combinatorial Optimization\u00a02, 399\u2013412 (1999)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73817-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:00:33Z","timestamp":1619517633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73817-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738169"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73817-6_3","relation":{},"subject":[]}}