✦ LIBER ✦

Scheduling chains to minimize mean flow time

✍ Scribed by Moshe Dror; Wieslaw Kubiak; Paolo Dell'Olmo

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 392 KB
Volume: 61
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00037-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preemptive scheduling to minimize mean w

Preemptive scheduling to minimize mean weighted flow time

✍ Joseph Y-T. Leung; Gilbert H. Young 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 341 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

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 parallel processors to minimi

Scheduling parallel processors to minimize setup time

✍ Robert T. Sumichrast 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 735 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

One machine sequencing to minimize mean

One machine sequencing to minimize mean flow time with minimum number tardy

✍ Hamilton Emmons 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 459 KB