✦ LIBER ✦

Preemptive scheduling to minimize mean weighted flow time

✍ Scribed by Joseph Y-T. Leung; Gilbert H. Young

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 341 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90229-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling chains to minimize mean flow

Scheduling chains to minimize mean flow time

✍ Moshe Dror; Wieslaw Kubiak; Paolo Dell'Olmo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 392 KB

On-line scheduling to minimize max flow

On-line scheduling to minimize max flow time: an optimal preemptive algorithm

✍ Christoph Ambühl; Monaldo Mastrolilli 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 170 KB

We investigate the maximum flow time minimization problem of on-line scheduling jobs on m identical parallel machines. When preemption is allowed, we derive an optimal algorithm with competitive ratio 2 -1/m. When preemption is not allowed and m = 2, we show that the First In First Out heuristic ach

Schedule of n jobs on two identical mach

Schedule of n jobs on two identical machines to minimize weighted mean flow time

✍ Bahram Alidaee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Scheduling on M parallel machines subjec

Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

✍ Ali Allahverdi; John Mittenthal 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 1 views

Scheduling unit time open shops to minim

Scheduling unit time open shops to minimize the weighted number of late jobs

✍ Peter Brucker; Bernd Jurisch; Thomas Tautenhahn; Frank Werner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Preemptive scheduling of equal-length jo

Preemptive scheduling of equal-length jobs to maximize weighted throughput

✍ Philippe Baptiste; Marek Chrobak; Christoph Dürr; Wojciech Jawor; Nodari Vakhani 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 214 KB