✦ LIBER ✦

Minimizing Mean Flow Time With Release Time and Deadline Constraints

✍ Scribed by J.Z. Du; J.Y.T. Leung

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 988 KB
Volume: 14
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1993.1003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing mean flow-time with parallel

Minimizing mean flow-time with parallel processors and resource constraints

✍ Błażewicz, J. ;Kubiak, W. ;Röck, H. ;Szwarcfiter, J. 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

Preemptive scheduling with release times

Preemptive scheduling with release times and deadlines

✍ Kwang Soo Hong; Joseph Y-T. Leung 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 905 KB

We consider the problem of deciding if there is a feasible preemptive schedule for a set of n independent tasks with release times and deadlines on m identical processors. The general problem is known to be solvable in O(n 3) time. In this paper, we study special cases for which faster algorithms ex

Minimizing Mean Flow Time in Two-Machine

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

✍ J.Z. Du; J.Y.T. Leung 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 770 KB

A note on “scheduling unit-time tasks wi

A note on “scheduling unit-time tasks with integer release times and deadlines”

✍ George Steiner; Scott Yeomans 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Scheduling to minimize the total weighte

Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption

✍ A. Janiak; C.-L. Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Bounds for naive multiple machine schedu

Bounds for naive multiple machine scheduling with release times and deadlines

✍ Dan Gusfield 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 385 KB