Sciweavers

Share
65 search results - page 1 / 13
» Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim...
Sort
View
MICS
2010
77views more  MICS 2010»
8 years 8 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
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...
George B. Mertzios, Walter Unger
CORR
2002
Springer
78views Education» more  CORR 2002»
8 years 10 months ago
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput
Philippe Baptiste, Marek Chrobak, Christoph Dü...
ICALP
2004
Springer
9 years 3 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is speciļ¬ed by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
AOR
2006
77views more  AOR 2006»
8 years 10 months ago
Preemptive Scheduling with Position Costs
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...
Francis Sourd
books