𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds for naive multiple machine scheduling with release times and deadlines

✍ Scribed by Dan Gusfield

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
385 KB
Volume
5
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Preemptive scheduling with release times
Preemptive scheduling with release times and deadlines
✍ Kwang Soo Hong; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 1989 πŸ› Springer US 🌐 English βš– 905 KB

We consider the problem of deciding if there is a feasible preemptive schedule for a set of n independent tasks with release times and deadlines on m identical processors. The general problem is known to be solvable in O(n 3) time. In this paper, we study special cases for which faster algorithms ex

Online real-time preemptive scheduling o
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
✍ Bhaskar Das Gupta; Michael A. Palis πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-

Mixed satisfiability tests for multiproc
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines
✍ F. Tercinet; C. LentΓ©; E. NΓ©ron πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 197 KB

We investigate classical satisΓΏability tests for P|ri; di|-. Our motivation is to use the complementarity of classical preemptive relaxation and energetic reasoning. Thus minimum capacity constraints, based on the notion of mandatory parts of activities, are added to the classical max-ow formulation