✦ LIBER ✦

Scheduling dyadic intervals

✍ Scribed by James R. Driscoll; Dennis M. Healy; Garth T. Isaak

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 882 KB
Volume: 63
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00068-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interval scheduling: A survey

✍ Antoon W.J. Kolen; Jan Karel Lenstra; Christos H. Papadimitriou; Frits C.R. Spie 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

Online interval scheduling: randomized

✍ Stanley P. Y. Fung; Chung Keung Poon; Feifeng Zheng 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 325 KB

Note on scheduling intervals on-line

✍ Ulrich Faigle; Willem M. Nawijn 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Interval Scheduling on identical machine

Interval Scheduling on identical machines

✍ Khalid I. Bouzina; Hamilton Emmons 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 673 KB

Scheduling Interval Ordered Tasks in Par

Scheduling Interval Ordered Tasks in Parallel

✍ Sivaprakasam Sunder; Xin He 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

We present the first NC algorithm for scheduling n unit length tasks on m identical processors for the case where the precedence constraint is an interval order. Our algorithm runs on a priority concurrent read, concurrent write parallel Ž 2 . Ž 5 . Ž 3 . random access machine in O log n with O n pr

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