{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T12:50:16Z","timestamp":1774443016309,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,20]],"date-time":"2008-11-20T00:00:00Z","timestamp":1227139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10845-008-0203-4","type":"journal-article","created":{"date-parts":[[2008,11,19]],"date-time":"2008-11-19T19:43:11Z","timestamp":1227123791000},"page":"5-15","source":"Crossref","is-referenced-by-count":62,"title":["Constraint satisfaction techniques in planning and scheduling"],"prefix":"10.1007","volume":"21","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Salido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,20]]},"reference":[{"key":"203_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"K.R. Apt","year":"2003","unstructured":"Apt K.R. (2003). Principles of constraint programming. Cambridge University Press, Cambridge"},{"key":"203_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste P., Laborie P., Le Pape C., Nuijten W. (2006). Constraint-based scheduling and planning. In Handbook of Constraint Programming (pp. 761\u2013799). Amsterdam: Elsevier.","DOI":"10.1016\/S1574-6526(06)80026-X"},{"key":"203_CR3","unstructured":"Baptiste, P., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the 15th Workshop of the UK Planning and Scheduling Special Interest Group, Liverpool, UK."},{"key":"203_CR4","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (1995). Constraint-based optimization and approximation for job-shop scheduling. In Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95, Montreal, Canada."},{"key":"203_CR5","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling. Springer.","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"203_CR6","unstructured":"Bart\u00e1k, R. (1998). On-line guide to constraint programming. http:\/\/kti.mff.cuni.cz\/~bartak\/constraints\/index.html ."},{"key":"203_CR7","unstructured":"Bart\u00e1k, R. (2000). Toward mixed planning and scheduling. In Proceedings of CPDC\u201900 Workshop (Invited Talk), Stenungsund, Sweden."},{"key":"203_CR8","doi-asserted-by":"crossref","first-page":"320","DOI":"10.4018\/978-1-59140-450-7.ch010","volume-title":"Intelligent techniques for planning","author":"R. Bart\u00e1k","year":"2005","unstructured":"Bart\u00e1k R. (2005). Constraint satisfaction for planning and scheduling. In: Vlahavas, I. and Vrakas, D. (eds) Intelligent techniques for planning, pp 320\u2013353. Idea Group, Hershey, PA"},{"key":"203_CR9","unstructured":"Bart\u00e1k, R., & Toropila, D. (2008). Reformulating constraint models for classical planning. In Proceedings of the 21st International Florida AI Research Society Conference (FLAIRS 2008), Florida, USA, pp. 525\u2013530."},{"key":"203_CR10","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"J.R. Bitner","year":"1975","unstructured":"Bitner J.R. and Reingold E.M. (1975). Backtracking programming techniques. Communications of the ACM 18: 651\u2013655","journal-title":"Communications of the ACM"},{"key":"203_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. Blum","year":"1997","unstructured":"Blum A. and Furst M. (1997). Fast planning through planning graph analysis. Artificial Intelligence 90: 281\u2013300","journal-title":"Artificial Intelligence"},{"key":"203_CR12","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter R. (2003). Constraint processing. Morgan Kaufmann, San Mateo, CA"},{"key":"203_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter R., Meiri I. and Pearl J. (1991). Temporal constraint network. Artificial Intelligence 49: 61\u201395","journal-title":"Artificial Intelligence"},{"key":"203_CR14","unstructured":"Edelkamp, S., Jabar, S., & Nazih, M. (2006). Large-scale optimal PDDL3 planning with MIPS-XXL. In 5th International Planning Competition Booklet (IPC-2006), Lake District, England, pp. 28\u201330."},{"key":"203_CR15","unstructured":"Frost, D., & Dechter, R. (1994). Dead-end driven learning. In Proceedings of the National Conference on Artificial Intelligence, Seattle, USA, pp. 294\u2013300."},{"key":"203_CR16","unstructured":"Garrido, A., Salido, M. A., & Barber, F. (2000). Scheduling in a planning environment. In Proceedings of ECAI-2000 Workshop on New Results in Planning, Scheduling and Design (PUK-2000), Berlin, Germany, pp. 36\u201343."},{"key":"203_CR17","unstructured":"Gaschnig, J. (1977). A general backtrack algorithm that eliminates most redundant tests. In Procceedings of IJCAI, Cambridge, MA, USA, pp. 457."},{"key":"203_CR18","unstructured":"Gaschnig, J. (1979). Performance measurement and analysis of certain search algorithms. Technical Report CMU-CS-79-124, Carnegie-Mellon University."},{"key":"203_CR19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1613\/jair.1742","volume":"25","author":"A. Gerevini","year":"2006","unstructured":"Gerevini A., Saetti A. and Serina I. (2006). An approach to temporal planning and scheduling in domains with predictable exogenous events. Journal of Artificial Intelligence Research 25: 187\u2013231","journal-title":"Journal of Artificial Intelligence Research"},{"key":"203_CR20","unstructured":"Gerevini, A., & Serina, I. (2000). Fast plan adaptation through planning graphs: Local and systematic search techniques. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, Breckenridge, CO, USA, pp. 112\u2013121."},{"key":"203_CR21","volume-title":"Automated planning: Theory and practice","author":"M. Ghallab","year":"2004","unstructured":"Ghallab M., Nau D. and Traverso P. (2004). Automated planning: Theory and practice. Morgan Kaufmann, San Francisco, CA"},{"key":"203_CR22","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham R.L., Lawler E.L., Lenstra J.K. and Rinnooy-Kan A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: 287\u2013326","journal-title":"Annals of Discrete Mathematics"},{"key":"203_CR23","unstructured":"Halsey, K., Long, D., & Foz, M. (2004). CRIKEY\u2014A temporal planner looking at the integration of planning and scheduling. In Proceedings on the ICAPS 2004 Workshop on Integrating Planning and Scheduling, Whistler, Canada, pp. 46\u201352."},{"key":"203_CR24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"Haralick R. and Elliot G. (1980). Increasing tree efficiency for constraint satisfaction problems. Artificial Intelligence 14: 263\u2013314","journal-title":"Artificial Intelligence"},{"key":"203_CR25","unstructured":"Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proceedings of ECAI, Vienna, Austria, pp. 359\u2013363."},{"key":"203_CR26","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P. Laborie","year":"2003","unstructured":"Laborie P. (2003). Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143: 151\u2013188","journal-title":"Artificial Intelligence"},{"key":"203_CR27","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"J.Y.T. Leung","year":"2004","unstructured":"Leung J.Y.T. (2004). Handbook of scheduling: Algorithms, models and performance analysis. Chapman & Hall, Boca Raton, FL"},{"key":"203_CR28","unstructured":"Lhomme, O. (1993). Consistency techniques for numeric CSPs. In Proceedings of 13th International Joint Conference on Artificial Intelligence, Chamb\u00e9ry, France, pp. 232\u2013238."},{"key":"203_CR29","unstructured":"Lopez, A., & Bacchus, F. (2003). Generalizing GraphPlan by formulating planning as a CSP. In Proceedings of IJCAI, Acapulco, Mexico, pp. 954\u2013960."},{"key":"203_CR30","unstructured":"McGann, C., Py, F., Rajan, K., Ryan, J., & Henthorn, R. (2008). Adaptive control for autonomous underwater vehicles. In Proceedings of AAAI\u201908, Chicago, USA, pp. 1319\u20131324."},{"key":"203_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04131-4","volume-title":"How to solve it: Modern heuristics","author":"Z. Michalewicz","year":"2000","unstructured":"Michalewicz Z. and Fogel D.B. (2000). How to solve it: Modern heuristics. Springer, Berlin"},{"key":"203_CR32","unstructured":"Muscettola, N. (1993). HSTS: Integrating planning and scheduling. Technical Report CMU-RI-TR-93-05, Robotics Institute, Carnegie Mellon University."},{"key":"203_CR33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(98)00068-X","volume":"103","author":"N. Muscettola","year":"1998","unstructured":"Muscettola N., Nayak P., Pell B. and Williams B. (1998). Remote agent: To boldly go where no AI system has gone before. Artificial Intelligence 103: 5\u201347","journal-title":"Artificial Intelligence"},{"key":"203_CR34","unstructured":"Planken, L., de Weerdt, M., & Van der Krogt, R. (2008). P 3 C: A new algorithm for the simple temporal problem. In Proceedings of ICAPS-2008, Sydney, Australia, pp. 256\u2013263."},{"key":"203_CR35","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser P. (1993). Hybrid algorithm for the constraint satisfaction problem. Computational Intelligence 9: 268\u2013299","journal-title":"Computational Intelligence"},{"key":"203_CR36","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4074.001.0001","volume-title":"Knowledge in action: Logical foundations for specifying and implementing dynamic systems","author":"R. Reiter","year":"2001","unstructured":"Reiter R. (2001). Knowledge in action: Logical foundations for specifying and implementing dynamic systems. MIT Press, Cambridge, MA"},{"key":"203_CR37","volume-title":"Handbook of constraint programming","author":"F. Rossi","year":"2006","unstructured":"Rossi F., Walsh T. and Van Beek P. (2006). Handbook of constraint programming. Elsevier, Amsterdam"},{"key":"203_CR38","unstructured":"Ruml, W., Do, M. B., & Fromherz, M. (2005). On-line planning and scheduling for high-speed manufacturing. In Proceedings of ICAPS\u201905, Monterey, USA, pp. 30\u201339."},{"key":"203_CR39","unstructured":"Ruttkay, Z. (1998). Constraint satisfaction\u2014A survey. CWI Quarterly, 11(2&3), 123\u2013162."},{"key":"203_CR40","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1017\/S0269888900001089","volume":"15","author":"D.E. Smith","year":"2000","unstructured":"Smith D.E., Frank J. and Jonsson A.K. (2000). Bridging the gap between planning and scheduling. Knowledge Enginering Review 15: 47\u201383","journal-title":"Knowledge Enginering Review"},{"key":"203_CR41","unstructured":"Smith, S. F., & Cheng, Ch.-Ch. (1993). Slack-based heuristics for constraint satisfaction scheduling. In Proceedings of the National Conference on Artificial Intelligence (AAAI), Washington, USA, pp. 139\u2013144."},{"key":"203_CR42","unstructured":"Smith, S. F., Lassila, O., & Becker, M. (1996). Configurable, mixed-initiative systems for planning and scheduling. In A. Tate (Ed.), Advanced planning (pp. 235\u2013241). AAAI Press."},{"key":"203_CR43","unstructured":"Srivastava, B., & Kambhampati, S. (1999a). Efficient planning through separate resource scheduling. AAAI Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, Orlando, USA."},{"key":"203_CR44","doi-asserted-by":"crossref","unstructured":"Srivastava, B., & Kambhampati, S. (1999b). Scaling up planning by teasing out resource scheduling. In Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning, Durham, UK, pp. 172\u2013186.","DOI":"10.1007\/10720246_14"},{"key":"203_CR45","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0377-2217(99)00497-X","volume":"127","author":"P. Torres","year":"2000","unstructured":"Torres P. and Lopez P. (2000). On Not-First\/Not-Last conditions in disjunctive scheduling. European Journal of Operational Research 127: 332\u2013343","journal-title":"European Journal of Operational Research"},{"key":"203_CR46","volume-title":"Foundation of constraint satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang E. (1993). Foundation of constraint satisfaction. Academic Press, London"},{"key":"203_CR47","unstructured":"van Beek, P., & Chen, X. (1999). CPlan: A constraint programming approach to planning. In Proceedings of AAAI-99, Orlando, USA, pp. 585\u2013590."},{"key":"203_CR48","unstructured":"Vidal, V., & Geffner, H. (2004). Branching and pruning: An optimal temporal POCL planner based on constraint programming. In Proceedings of AAAI-04, San Jose, USA, pp. 570\u2013577."},{"key":"203_CR49","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.artint.2005.08.004","volume":"170","author":"V. Vidal","year":"2006","unstructured":"Vidal V. and Geffner H. (2006). Branching and prunning: An optimal temporal pocl planner based on constraint programming. Artificial Intelligence 170: 298\u2013335","journal-title":"Artificial Intelligence"},{"key":"203_CR50","unstructured":"Vil\u00edm, P. (2004). O(n log n) Filtering algorithms for unary resource constraint. In Proceedings of CPAIOR, Nice, France, pp. 335\u2013347."},{"issue":"4","key":"203_CR51","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10601-005-2814-0","volume":"10","author":"P. Vil\u00edm","year":"2005","unstructured":"Vil\u00edm P., Bart\u00e1k R. and Cepek O. (2005). Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities. Constraints 10(4): 403\u2013425","journal-title":"Constraints"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-008-0203-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-008-0203-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-008-0203-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T19:40:55Z","timestamp":1632253255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-008-0203-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,20]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s10845-008-0203-4","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,20]]}}}