Scheduling project networks with resource constraints and time windows
Annals of Operations Research
Artificial Intelligence - Special issue on knowledge representation
IEEE Transactions on Parallel and Distributed Systems
Scheduling alternative activities
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Constraint-directed techniques for scheduling alternative activities
Artificial Intelligence
The vehicle routing problem
Constraint-Based Scheduling
Logic-Based Methods for Optimization
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Scheduling Multi-capacitated Resources Under Complex Temporal Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling Aircraft Landings--The Static Case
Transportation Science
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
Instruction Scheduling for Clustered VLIW DSPs
PACT '00 Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques
A Hybrid Method for the Planning and Scheduling
Constraints
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
INFORMS Journal on Computing
The Journal of Supercomputing
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
AI Communications - Constraint Programming for Planning and Scheduling
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Critical-path planning and scheduling
IRE-AIEE-ACM '59 (Eastern) Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference
Temporal Reasoning in Nested Temporal Networks with Alternatives
Recent Advances in Constraints
Assignment Problems
Planning and Scheduling by Logic-Based Benders Decomposition
Operations Research
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Max Energy Filtering Algorithm for Discrete Cumulative Resources
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Augmenting disjunctive temporal problems with finite-domain constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Complete MCS-based search: application to resource constrained project scheduling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Allocation and scheduling of Conditional Task Graphs
Artificial Intelligence
A precedence constraint posting approach for the RCPSP with time lags and variable durations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Why cumulative decomposition is not as bad as it sounds
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Reactive scheduling in the multi-mode RCPSP
Computers and Operations Research
Slack-based heuristics for constraint satisfaction scheduling
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Timetable edge finding filtering algorithm for discrete cumulative resources
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Single-Facility scheduling over long time horizons by logic-based benders decomposition
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
FASA: a scalable software framework for distributed control systems
Proceedings of the 3rd international ACM SIGSOFT symposium on Architecting Critical Systems
On heterogeneous network-on-chip design based on constraint programming
Proceedings of the Sixth International Workshop on Network on Chip Architectures
Hi-index | 0.02 |
Classical scheduling formulations typically assume static resource requirements and focus on deciding when to start the problem activities, so as to optimize some performance metric. In many practical cases, however, the decision maker has the ability to choose the resource assignment as well as the starting times: this is a far-from-trivial task, with deep implications on the quality of the final schedule. Joint resource assignment and scheduling problems are incredibly challenging from a computational perspective. They have been subject of active research in Constraint Programming (CP) and in Operations Research (OR) for a few decades, with quite difference techniques. Both the approaches report individual successes, but they overall perform equally well or (from a different perspective) equally poorly. In particular, despite the well known effectiveness of global constraints for scheduling, comparable results for joint filtering of assignment and scheduling variables have not yet been achieved. Recently, hybrid approaches have been applied to this class of problems: most of them work by splitting the overall problem into an assignment and a scheduling subparts; those are solved in an iterative and interactive fashion with a mix of CP and OR techniques, often reporting impressive speed-ups compared to pure CP and OR methods. Motivated by the success of hybrid algorithms on resource assignment and scheduling, we provide a cross-disciplinary survey on such problems, including CP, OR and hybrid approaches. The main effort is to identify key modeling and solution techniques: they may then be applied in the construction of new hybrid algorithms, or they may provide ideas for novel filtering methods (possibly based on decomposition, or on alternative representations of the domain store). In detail, we take a constraint-based perspective and, according to the equation CP = model + propagation + search, we give an overview of state-of-art models, propagation/bounding techniques and search strategies.