Paper Info
Title
Efficient Edge-Finding on Unary Resources with Optional Activities
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.
Year
DOI
Venue
2007
10.1007/978-3-642-00675-3_3
Applications of Declarative Programming and Knowledge Management
Keywords
Field
DocType
optional activity,constraint programming environment,unary resources.,unary resources,new algorithm,optional activities,modelling scheduling problem,unary resource,modified job-shop,efficient edge-finding,optional tasks and activities,central role,external factor,edge-finding algorithm,constraint-based scheduling,final schedule,global constraints,scheduling problem,constraint programming
Mathematical optimization,Unary operation,Scheduling (computing),Computer science,Constraint programming
Conference
Citations 
PageRank 
References 
2
0.43
5
Authors
1
Name
Order
Citations
PageRank
Sebastian Kuhnert1366.52