✦ LIBER ✦

Algorithms with limited number of preemptions for scheduling on parallel machines

✍ Scribed by Yiwei Jiang, Zewei Weng, Jueliang Hu

Book ID: 120694206
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 516 KB
Volume: 27
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9545-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel Processor Scheduling with Limit

Parallel Processor Scheduling with Limited Number of Preemptions

✍ Braun, Oliver; Schmidt, Günter 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 161 KB

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

Randomized truthful algorithms for sched

Randomized truthful algorithms for scheduling selfish tasks on parallel machines

✍ Eric Angel; Evripidis Bampis; Nicolas Thibault 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Performance of scheduling algorithms for

Performance of scheduling algorithms for no-wait flowshops with parallel machines

✍ C. Sriskandarajah 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Exact algorithms for scheduling multiple

Exact algorithms for scheduling multiple families of jobs on parallel machines

✍ Zhi-Long Chen; Warren B. Powell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o

Online LPT algorithms for parallel machi

Online LPT algorithms for parallel machines scheduling with a single server

✍ Chunjie Su 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 349 KB