64 search results - page 1 / 13 » Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim... |
MICS
2010
13 years 9 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
CORR
2002
Springer
13 years 10 months ago
2002
Springer
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
AOR
2006
13 years 11 months ago
2006
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...