𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on sequencing jobs with deadlines problem

✍ Scribed by Krzysztof Dudziński; Krzysztof Szkatuła

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
215 KB
Volume
59
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequencing independent jobs with a singl
Sequencing independent jobs with a single resource
✍ Kenneth R. Baker; Henry L. W. Nuttle 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 591 KB

## Abstract This paper examines problems of sequencing __n__ jobs for processing by a single resource to minimize a function of job completion times, when the availability of the resource varies over time. A number of well‐known results for single‐machine problems which can be applied with little o

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-