conference paper
Optimal Batch Schedules for Parallel Machines
Frederic Koehlera, Samir Khullerb
- aPrinceton Univ., Princeton, NJ, 08544, USA
- bDept. of Computer Science, Univ. of Maryland, College Park, MD, 20742, USA
Lecture notes in computer scienceSpringer Science+Business Media2013-01-01 24 citations15 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRA O(n3) algorithm for simultaneously minimizing the number of batches and maximum completion time is presented, and improved guarantees for variants with infinite size batches, agreeable release times, and batch "budgets" are given. (Semantic Scholar)