25 search results - page 1 / 5 » On-line scheduling of unit time jobs with rejection: minimiz... |
90
Voted
ORL
2002
14 years 10 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
90
Voted
MOR
2000
14 years 10 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
COR
2007
14 years 10 months ago
2007
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
110
Voted
CONSTRAINTS
2011
14 years 5 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...
90
Voted
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...