✦ LIBER ✦

Scheduling uniform machines on-line requires nondecreasing speed ratios

✍ Scribed by Arjen P. A. Vestjens

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 624 KB
Volume: 82
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01585873

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Competitive ratio of List Scheduling on

Competitive ratio of List Scheduling on uniform machines and

✍ Antoine Musitelli; Jean-Marc Nicoletti 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 464 KB

The asymptotic performance ratio of an o

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates

✍ Mabel C. Chou; Maurice Queyranne; David Simchi-Levi 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 351 KB

Semi on-line scheduling for maximizing t

Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines

✍ Luo Run-zi; Sun Shi-jie 📂 Article 📅 2005 🏛 SP Zhejiang University Press 🌐 English ⚖ 396 KB

Preemptive and Non-preemptive On-line Al

Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines

✍ G. Dósa; Y. He 📂 Article 📅 2005 🏛 Springer Vienna 🌐 English ⚖ 167 KB