✦ LIBER ✦

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time

✍ Scribed by George B. Mertzios; Walter Unger

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 331 KB
Volume: 3
Category: Article
ISSN: 1661-8270
DOI: 10.1007/s11786-009-0003-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Parallel batch scheduling of equal-lengt

Parallel batch scheduling of equal-length jobs with release and

✍ Alessandro Condotta; Sigrid Knust; Natalia V. Shakhlevich 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 715 KB

AnO(n2) algorithm for scheduling equal-l

AnO(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

✍ Zhongjun Tian; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 423 KB

Scheduling Equal Processing Time Jobs to

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

✍ Peter Brucker; Svetlana A. Kravchenko 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 705 KB

Online real-time preemptive scheduling o

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

✍ Bhaskar Das Gupta; Michael A. Palis 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-

Level scheduling to minimize schedule le

Level scheduling to minimize schedule length on lots of unit-time jobs

✍ Michael B. Richey 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 148 KB