x
|
Abstract:
We consider the following fundamental scheduling problem. The input to the problem consists of n jobs and k machines. Each of the jobs is associated with a release time, a deadline, a weight, and a processing time on each of the machines. The goal is to nd a schedule that maximizes the weight of jobs that meet their deadline. We give constant factor approximation algorithms for four variants of the problem, depending on the type of the machines (identical vs. unrelated), and the weight of the jobs (identical vs. arbitrary). All these variants are known to be NP-Hard, and we observe that the two variants involving unrelated machines are also MAX-SNP hard. To the best of our knowledge, these are the rst approximation algorithms for such problems in the non-preemptive o-line setting. The specic results obtained are: For identical job weights and unrelated machines: a greedy 2-approximation algorithm. For identical job weights and k identical machines: the same greedy algorithm achieves a tight (1+1=k)
Citations
| 41 | Online competitive algorithms for call admission in optical networks – Awerbuch, Azar, et al. |
| 30 | Minimizing stall time in single and parallel disk systems – Albers, Garg, et al. - 1998 |
| 22 | Scheduling time-constrained communication in linear networks – Adler, Rosenberg, et al. - 1998 |
| 3 | Scheduling jobs with start and end times – Arkin, Silverberg - 1987 |
