caa a22 4500 445879238 CHVBK 20180317145537.0 cr unu---uuuuu 170323e20110701xx s 000 0 eng 10.1007/s10601-011-9109-4 doi (NATIONALLICENCE)springer-10.1007/s10601-011-9109-4 Constraint satisfaction for planning and scheduling problems [Elektronische Daten] [Roman Barták, Miguel Salido] The areas of planning and scheduling (from the Artificial Intelligence point of view) have seen important advances thanks to application of constraint satisfaction techniques. Currently, many important real-world problems require efficient constraint handling for planning, scheduling and resource allocation to competing goal activities over time in the presence of complex state-dependent constraints. Solutions to these problems require integration of resource allocation and plan synthesis capabilities. Hence to manage such complex problems planning, scheduling and constraint satisfaction must be interrelated. This special issue on Constraint Satisfaction for Planning and Scheduling Problems compiles a selection of papers dealing with various aspects of applying constraint satisfaction techniques in planning and scheduling. The core of submitted papers was formed by the extended versions of papers presented at COPLAS'2009: ICAPS 2009 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. This issue presents novel advances on planning, scheduling, constraint programming/constraint satisfaction problems (CSPs) and many other common areas that exist among them. On the whole, this issue mainly focus on managing complex problems where planning, scheduling, constraint satisfaction and search must be combined and/or interrelated, which entails an enormous potential for practical applications and future research. Springer Science+Business Media, LLC, 2011 Planning nationallicence Scheduling nationallicence Constraint programming nationallicence Search nationallicence Barták Roman Faculty of Mathematics and Physics, Charles University in Prague, Prague, Czech Republic aut Salido Miguel Instituto de Automática e Informàtica Industrial, Universidad Politécnica de Valencia, Valencia, Spain aut Constraints Springer US; http://www.springer-ny.com 16/3(2011-07-01), 223-227 1383-7133 16:3<223 2011 16 10601 https://doi.org/10.1007/s10601-011-9109-4 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10601-011-9109-4 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Barták Roman Faculty of Mathematics and Physics, Charles University in Prague, Prague, Czech Republic aut NATIONALLICENCE 700 1- Salido Miguel Instituto de Automática e Informàtica Industrial, Universidad Politécnica de Valencia, Valencia, Spain aut NATIONALLICENCE 773 0- Constraints Springer US; http://www.springer-ny.com 16/3(2011-07-01), 223-227 1383-7133 16:3<223 2011 16 10601 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer