𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Preemptive scheduling with rejection

✍ Scribed by Han Hoogeveen; Martin Skutella; Gerhard J. Woeginger

Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
125 KB
Volume
94
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rational preemptive scheduling
Rational preemptive scheduling
✍ N. W. Sauer; M. G. Stone πŸ“‚ Article πŸ“… 1987 πŸ› Springer Netherlands 🌐 English βš– 694 KB
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

Preemptive scheduling in overloaded syst
Preemptive scheduling in overloaded systems
✍ Marek Chrobak; Leah Epstein; John Noga; Jiřı́ Sgall; Rob van Stee; TomΓ‘Ε‘ TichΓ½; πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 209 KB

The following scheduling problem is studied: We are given a set of tasks with release times, deadlines, and profit rates. The objective is to determine a 1-processor preemptive schedule of the given tasks that maximizes the overall profit. In the standard model, each completed task brings profit, wh