✦ LIBER ✦

On preemption redundancy in scheduling unit processing time jobs on two parallel machines

✍ Scribed by Philippe Baptiste; Vadim G. Timkovsky

Book ID: 108410430
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 103 KB
Volume: 28
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(01)00068-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Online scheduling of parallel jobs with

Online scheduling of parallel jobs with preemption on two identical machines

✍ Guo, Shouwei; Kang, Liying 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Scheduling unit length jobs on parallel

Scheduling unit length jobs on parallel machines with lookahead information

✍ Marvin Mandelbaum; Dvir Shabtay 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 683 KB

Soft due window assignment and schedulin

Soft due window assignment and scheduling of unit-time jobs on parallel machines

✍ Janiak, Adam; Janiak, Wladyslaw; Kovalyov, Mikhail Y.; Werner, Frank 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 258 KB

Equal Processing Time Bicriteria Schedul

Equal Processing Time Bicriteria Scheduling on Parallel Machines

✍ Subhash C. Sarin; Divya Prakash 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 159 KB

Preemptive Scheduling on Uniform Paralle

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times

✍ Natalia V. Shakhlevich; Vitaly A. Strusevich 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 541 KB

Scheduling identical jobs on uniform par

Scheduling identical jobs on uniform parallel machines with random processing times

✍ Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 261 KB

For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.