Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
Constraint-based techniques are frequently used in solving real-life scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encod...
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...