Planning for conjunctive goals
Artificial Intelligence
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
Artificial Intelligence - Special issue on knowledge representation
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
Hierarchisation of the search space in temporal planning
New directions in AI planning
Constraint-Based Scheduling
A Constraint-Based Method for Project Scheduling with Time Windows
Journal of Heuristics
A Time and Resource Problem for Planning Architectures
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Multiple-Machine Lower Bounds for Shop-Scheduling Problems
INFORMS Journal on Computing
Gaining efficiency and flexibility in the simple temporal problem
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Reviving partial order planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Planning with sharable resource constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Computing the Envelope for Stepwise-Constant Resource Allocations
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Controlling complex physical systems through planning and scheduling integration
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Branching and pruning: an optimal temporal POCL planner based on constraint programming
Artificial Intelligence
A case study of mutual routing-scheduling reformulation
Journal of Scheduling
Continuous refinement of agent resource estimates
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
AI Communications - Constraint Programming for Planning and Scheduling
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Managing concurrency in temporal planning using planner-scheduler interaction
Artificial Intelligence
International Journal of Artificial Intelligence and Soft Computing
Low-knowledge algorithm control
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
An effective algorithm for project scheduling with arbitrary temporal constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Branching and pruning: an optimal temporal POCL planner based on constraint programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Exploiting the structure of hierarchical plans in temporal constraint propagation
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
PDDL 2.1: representation vs. computation
Journal of Artificial Intelligence Research
Proactive algorithms for job shop scheduling with probabilistic durations
Journal of Artificial Intelligence Research
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
Resource temporal networks: definition and complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Discrete Applied Mathematics
Complete MCS-based search: application to resource constrained project scheduling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Proactive algorithms for scheduling with probabilistic durations
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A cyclic approach to large-scale short-term planning in chemical batch production
Journal of Scheduling
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Allocation and scheduling of Conditional Task Graphs
Artificial Intelligence
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Scheduling conditional task graphs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A constraint model for state transitions in disjunctive resources
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
A hybrid constraint programming/local search approach to the job-shop scheduling problem
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Mathematically clinching a playoff spot in the NHL and the effect of scoring systems
Canadian AI'08 Proceedings of the Canadian Society for computational studies of intelligence, 21st conference on Advances in artificial intelligence
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
The Knowledge Engineering Review
Constraint based scheduling to deal with uncertain durations and self-timed execution
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Constraint-based methods for scheduling discretionary services
AI Communications
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
Constraint-based modeling and scheduling of clinical pathways
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Solving production scheduling with earliness/tardiness penalties by constraint programming
Journal of Intelligent Manufacturing
Stochastic allocation and scheduling for conditional task graphs in MPSoCs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Scheduling scientific experiments on the rosetta/philae mission
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The offshore resources scheduling problem: detailing a constraint programming approach
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Proceedings of the Winter Simulation Conference
A resource enhanced HTN planning approach for emergency decision-making
Applied Intelligence
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Distributed reasoning for multiagent simple temporal problems
Journal of Artificial Intelligence Research
Training for crisis decision making - An approach based on plan adaptation
Knowledge-Based Systems
Product and Production Process Modeling and Configuration
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
This paper summarizes the main existing approaches to propagate resource constraints in Constraint-Based scheduling and identifies some of their limitations for using them in an integrated planning and scheduling framework. We then describe two new algorithms to propagate resource constraints on discrete resources and reservoirs. Unlike most of the classical work in scheduling, our algorithms focus on the precedence relations between activities rather than on their absolute position in time. They are efficient even when the set of activities is not completely defined and when the time window of activities is large. These features explain why our algorithms are particularly suited for integrated planning and scheduling approaches. All our algorithms are illustrated with examples. Encouraging preliminary results are reported on pure scheduling problems as well as some possible extensions of our framework.