✦ LIBER ✦

Weighted flow time bounds for scheduling identical processors

✍ Scribed by Scott Webster

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 597 KB
Volume: 80
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)e0142-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-clairvoyant scheduling for weighted

Non-clairvoyant scheduling for weighted flow time

✍ Jae-Hoon Kim; Kyung-Yong Chwa 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 115 KB

A non-clairvoyant scheduler makes decisions having no knowledge of jobs. It does not know when the jobs will arrive in the future, that is, it is online, and how long the jobs will be executed after they arrive. For non-clairvoyant scheduling, we first study the problem to minimize the total stretch

Lower bounds on precedence-constrained s

Lower bounds on precedence-constrained scheduling for parallel processors

✍ Ivan D. Baev; Waleed M. Meleis; Alexandre Eichenberger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 72 KB

Flow-shop batch scheduling with identica

Flow-shop batch scheduling with identical processing-time jobs

✍ Gur Mosheiov; Daniel Oron; Yaacov Ritov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB

Improved Lower Bounds on Time and Proces

Improved Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems

✍ K.K. Jain; V. Rajaraman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 577 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

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