Linear Weighted-Task-Sum --- Scheduling Prioritized Tasks on a Single Resource

Authors:
Armin Wolf;Gunnar Schrader
Affiliations:
Fraunhofer FIRST, Berlin, Germany D-12489;sd&m AG, Berlin, Germany D-10719
Venue:
Applications of Declarative Programming and Knowledge Management
Year:
2009

Citing 7
Cited 1

Improved CLP scheduling with task intervals

Proceedings of the eleventh international conference on Logic programming
Constraint-Based Scheduling

Constraint-Based Scheduling
A Global Constraint Combining a Sum Constraint and Difference Constraints

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
When do bounds and domain propagation lead to the same search space

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Computing explanations for the unary resource constraint

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Better propagation for non-preemptive single-resource constraint problems

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

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

Optimized task scheduling is in general an NP-hard problem, even if the tasks are prioritized like surgeries in hospitals. Better pruning algorithms for the constraints within such constraint optimization problems, in particular for the constraints representing the objectives to be optimized, will result in faster convergence of branch & bound algorithms. This paper presents new pruning rules for linear weighted (task) sums where the summands are the start times of tasks to be scheduled on an exclusively available resource and weighted by the tasks' priorities. The presented pruning rules are proven to be correct and the speed-up of the optimization is shown in comparison with well-known general-purpose pruning rules for weighted sums.