𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Preemptive multiprocessor task scheduling with release times and time windows

✍ Scribed by L. Bianco; J. Blazewicz; P. Dell'Olmo; M. Drozdowski

Book ID
110380659
Publisher
Springer US
Year
1997
Tongue
English
Weight
88 KB
Volume
70
Category
Article
ISSN
0254-5330

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

The complexity of scheduling starting ti
The complexity of scheduling starting time dependent tasks with release times
✍ T.C.E. Cheng; Q. Ding πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 484 KB

We consider a family of problems of scheduling a set of starting time dependent tasks with release times and linearly increasing/decreasing processing rates on a single machine to minimize the makespan. We first present an equivalence relationship between several pairs of problems. Based on this rel