✦ LIBER ✦

A note on MULTIFIT scheduling for uniform machines

✍ Scribed by R. E. Burkard; Y. He

Book ID: 110625340
Publisher: Springer Vienna
Year: 1998
Tongue: English
Weight: 264 KB
Volume: 61
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02684354

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on hierarchical scheduling on two

A note on hierarchical scheduling on two uniform machines

✍ Zhiyi Tan; An Zhang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 325 KB

Randomized on-line scheduling on two uni

Randomized on-line scheduling on two uniform machines

✍ Leah Epstein; John Noga; Steve Seiden; Jiří Sgall; Gerhard Woeginger 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 178 KB

We study the problem of on-line scheduling on two uniform machines with speeds 1 and s\*1. A +1.61803 competitive deterministic algorithm was already known. We present the "rst randomized results for this problem: We show that randomization does not help for speeds s\*2, but does help for all s(2. W

A parallel algorithm for preemptive sche

A parallel algorithm for preemptive scheduling of uniform machines

✍ Charles U. Martel 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 982 KB

A linear compound algorithm for uniform

A linear compound algorithm for uniform machine scheduling

✍ R. E. Burkard; Y. He; H. Kellerer 📂 Article 📅 1998 🏛 Springer Vienna 🌐 English ⚖ 402 KB

Scheduling two agents on uniform paralle

Scheduling two agents on uniform parallel machines with

✍ Donatas Elvikis; Horst W. Hamacher; Vincent T’kindt 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 589 KB

Semi-online scheduling on two uniform ma

Semi-online scheduling on two uniform machines with

✍ Sheng-Yi Cai; Qi-Fan Yang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 592 KB