✦ LIBER ✦

On a special case of uniform processor scheduling

✍ Scribed by Manfred Kunde; Michael A Langston; Jin-Ming Liu

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 537 KB
Volume: 9
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(88)90043-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling independent two processor tas

Scheduling independent two processor tasks on a uniform duo-processor system

✍ J. Błaz̀ewicz; M. Drozdowski; G. Schmidt; D. De Werra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Scheduling chains on uniform processors

Scheduling chains on uniform processors with communication delays

✍ Wieslaw Kubiak1; Bernard Penz; Denis Trystram 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 200 KB

We show that the problem of scheduling chains of unit execution time (UET) jobs on uniform processors with communication delays to minimize makespan is NP-hard in the strong sense. We also give a heuristic that generates solutions with known, and relatively small, absolute error for this problem. Th

Scheduling to a common due date on paral

Scheduling to a common due date on parallel uniform processors

✍ Hamilton Emmons 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB 👁 2 views

Scheduling complete intrees on two unifo

Scheduling complete intrees on two uniform processors with communication delays

✍ Jacek Błażewicz; Pascal Bouvry; Frédéric Guinand; Denis Trystram 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 703 KB

Job scheduling to minimize expected weig

Job scheduling to minimize expected weighted flowtime on uniform processors

✍ Rhonda Righter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Scheduling on a single processor with va

Scheduling on a single processor with variable speed

✍ Bahram Alidaee; Ahmad Ahmadian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 384 KB