Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities

Authors:
Petr Vilím;Roman Barták;Ondřej Čepek
Affiliations:
Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1;Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1;Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1
Venue:
Constraints
Year:
2005

Citing 7
Cited 6

Improved CLP scheduling with task intervals

Proceedings of the eleventh international conference on Logic programming
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
Constraint-Based Scheduling

Constraint-Based Scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Batch Processing with Sequence Dependent Setup Times

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Realising the alternative resources constraint

INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming

Efficient Edge-Finding on Unary Resources with Optional Activities

Applications of Declarative Programming and Knowledge Management
Allocation and scheduling of Conditional Task Graphs

Artificial Intelligence
Review:

The Knowledge Engineering Review
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
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey

Constraints
MAK₠: a system for modelling, optimising, and analyzing production in small and medium enterprises

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among these global constraints, edge-finding and not-first/not-last are the most popular filtering algorithms for unary resources. In this paper we introduce new O(n log n) versions of these two filtering algorithms and one more O(n log n) filtering algorithm called detectable precedences. These algorithms use a special data structures 驴-tree and 驴-驴-tree. These data structures are especially designed for "what-if" reasoning about a set of activities so we also propose to use them for handling so called optional activities, i.e. activities which may or may not appear on the resource. In particular, we propose new O(n log n) variants of filtering algorithms which are able to handle optional activities: overload checking, detectable precedences and not-first/not-last.