𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling two agents on uniform parallel machines with

✍ Scribed by Donatas Elvikis; Horst W. Hamacher; Vincent T’kindt

Publisher
Springer US
Year
2010
Tongue
English
Weight
589 KB
Volume
14
Category
Article
ISSN
1094-6136

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

Scheduling identical jobs on uniform par
Scheduling identical jobs on uniform parallel machines with random processing times
✍ Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 261 KB

For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.