Preemptive scheduling on uniform machines to minimize mean flow time
- 31 October 2009
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 36 (10), 2816-2821
- https://doi.org/10.1016/j.cor.2008.12.010
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The complexity of mean flow time scheduling problems with release timesJournal of Scheduling, 2007
- Complexity of preemptive minsum scheduling on unrelated parallel machinesJournal of Algorithms, 2005
- Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release DatesLecture Notes in Computer Science, 2005
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978