Efficient Edge-Finding on Unary Resources with Optional Activities

Authors:
Sebastian Kuhnert
Affiliations:
Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany 10099
Venue:
Applications of Declarative Programming and Knowledge Management
Year:
2009

Citing 4
Cited 1

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
Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities

Constraints
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

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unary resources play a central role in modelling scheduling problems. Edge-finding is one of the most popular techniques to deal with unary resources in constraint programming environments. Often it depends on external factors if an activity will be included in the final schedule, making the activity optional. Currently known edge-finding algorithms cannot take optional activities into account. This paper introduces an edge-finding algorithm that finds restrictions for enabled and optional activities. The performance of this new algorithm is studied for modified job-shop and random-placement problems.