✦ LIBER ✦

On-line scheduling revisited

✍ Scribed by Rudolf Fleischer; Michaela Wahl

Publisher: Springer US
Year: 2000
Tongue: English
Weight: 98 KB
Volume: 3
Category: Article
ISSN: 1094-6136
DOI: 10.1002/1099-1425(200011/12)3:6<343::aid-jos54>3.0.co;2-2

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

Randomized On-line Scheduling of Paralle

Randomized On-line Scheduling of Parallel Jobs

✍ Jiřı&#x0301; Sgall 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

We study randomized on-line scheduling on mesh machines. We show that for scheduling independent jobs randomized algorithms can achieve a significantly better performance than deterministic ones; on the other hand with dependencies randomization does not help.

Grid scheduling by on-line rectangle pac

Grid scheduling by on-line rectangle packing

✍ Massimiliano Caramia; Stefano Giordani; Antonio Iovanella 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

On-line and off-line preemptive two-mach

On-line and off-line preemptive two-machine job shop scheduling

✍ Tracy Kimbrel; Jared Saia 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 82 KB 👁 1 views

Competitive On-line Scheduling of Contin

Competitive On-line Scheduling of Continuous-Media Streams

✍ Minos Garofalakis; Yannis Ioannidis; Banu Özden; Avi Silberschatz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 277 KB

within a small constant factor of log D (i.e., they are provably near-optimal) if r < 1/Klog DL; and (4) we introduce a novel admission control policy that partitions the server bandwidth based on the expected popularities of different request lengths and experimentally demonstrate its benefits comp

Cyclic scheduling in a robotic productio

Cyclic scheduling in a robotic production line

✍ Vladimir Kats; Eugene Levner 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 216 KB

The solution of cyclic scheduling problems is part of the classical repertoire on scheduling algorithms. We consider a problem of cyclic scheduling of identical parts in a production line where transportation of the parts between machines is performed by several robots. The problem is to ÿnd co-ordi