๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Non-preemptive Profile Scheduling and Quasi Interval Orders

โœ Scribed by Aziz Moukrim

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
336 KB
Volume
3
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Preemptive scheduling of interval orders
Preemptive scheduling of interval orders is polynomial
โœ N. W. Sauer; M. G. Stone ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 188 KB

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem for preemptive scheduling (a job can be interrupted to work on mo

Scheduling interval-ordered tasks with n
Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays
โœ Jacques Verriet ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

We study the problem of scheduling unit-length interval-ordered tasks subject to unitlength communication delays with the objective of minimising the maximum tardiness. Without communication delays, this problem can be solved by a generalisation of an algorithm presented by Garey and Johnson. In thi