Sciweavers

Share
MICS
2010
77views more  MICS 2010»
8 years 6 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
books