Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems

As the current planning and scheduling technologies are coming together by assuming time and resource constraints in planning or by allowing introduction of new activities during scheduling, the role of constraint satisfaction as the bridging technology is increasing and so it is important for researchers in these areas to understand the underlying principles and techniques. The chapter introduces constraint satisfaction technology with emphasis on its applications in planning and scheduling. It gives a brief survey of constraint satisfaction in general, including a description of mainstream solving techniques, that is, constraint propagation combined with search. Then, it focuses on specific time and resource constraints and on search techniques and heuristics useful in planning and scheduling. Last but not least, the basic approaches to constraint modelling for planning and scheduling problems are presented.

Download Full-text

Introduction to the special issue on constraint satisfaction for planning and scheduling

The Knowledge Engineering Review ◽

10.1017/s0269888917000017 ◽

2016 ◽

Vol 31 (5) ◽

pp. 415-416

Author(s):

Miguel A. Salido ◽

Roman Barták

Keyword(s):

Artificial Intelligence ◽

Resource Allocation ◽

Constraint Satisfaction ◽

Real World ◽

Real Life ◽

Special Issue ◽

Planning And Scheduling ◽

Artificial Intelligence Planning ◽

Life Problems ◽

Real World Problems

AbstractThe areas of Artificial Intelligence planning and scheduling have seen important advances thanks to the application of constraint satisfaction models and techniques. Especially, solutions to many real-world problems need to integrate plan synthesis capabilities with resource allocation, which can be efficiently managed by using constraint satisfaction techniques. Constraint satisfaction plays an important role in solving such real life problems, and integrated techniques that manage planning and scheduling with constraint satisfaction are particularly useful.

Download Full-text

Special issue on applications and methodologies for planning and scheduling: editorial

Journal of Scheduling ◽

10.1007/s10951-010-0187-8 ◽

2010 ◽

Vol 13 (4) ◽

pp. 299-300

Author(s):

Roman Barták ◽

Hana Rudová

Keyword(s):

Special Issue ◽

Planning And Scheduling

Download Full-text

How to model planning and scheduling problems using constraint networks on timelines

The Knowledge Engineering Review ◽

10.1017/s0269888910000172 ◽

2010 ◽

Vol 25 (3) ◽

pp. 319-336 ◽

Cited By ~ 13

Author(s):

Gérard Verfaillie ◽

Cédric Pralet ◽

Michel Lemaître

Keyword(s):

Dynamic Systems ◽

Discrete Event ◽

Discrete Event Dynamic Systems ◽

Scheduling Problems ◽

Planning And Scheduling ◽

Constraint Networks ◽

Modeling Power ◽

Mission Management ◽

Event Dynamic ◽

Domain Management

AbstractThe CNT framework (Constraint Network on Timelines) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this article, after a reminder about the CNT framework, we show its modeling power and its ability to support various modeling styles, coming from the planning, scheduling, and constraint programming communities. We do that by producing and comparing various models of two mission management problems in the aerospace domain: management of a team of unmanned air vehicles and of an Earth observing satellite.

Download Full-text