✦ LIBER ✦

Algorithms minimizing mean flow time: schedule-length properties

✍ Scribed by E. G. Coffman; Ravi Sethi

Publisher: Springer-Verlag
Year: 1976
Tongue: English
Weight: 671 KB
Volume: 6
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00263740

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

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

Minimizing Mean Flow Time with Error Con

Minimizing Mean Flow Time with Error Constraint

✍ J. Y. -T. Leung; T. W. Tam; C. S. Wong; G. H. Young 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 236 KB

Simulated annealing and genetic algorith

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

✍ Michael Andresen; Heidemarie Bräsel; Marc Mörig; Jan Tusch; Frank Werner; Per Wi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 401 KB

Minimizing Mean Flow Time With Release T

Minimizing Mean Flow Time With Release Time and Deadline Constraints

✍ J.Z. Du; J.Y.T. Leung 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 988 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