10 search results - page 1 / 2 » Resource Constraints for Preemptive Job-shop Scheduling |
CONSTRAINTS
2011
12 years 11 months ago
2011
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...
AAAI
1997
13 years 6 months ago
1997
In order to apply texture measurement based heuristic commitment techniques beyond the unary capacity resource constraints of job shop scheduling, we extend the contention texture...
CSCLP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
CONSTRAINTS
1998
13 years 4 months ago
1998
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
ANOR
2008
13 years 4 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...