The Complexity of Scheduling for p-Norms of Flow and Stretch
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 278-289
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Resource Augmentation for Weighted Flow-time explained by Dual Fitting2012
- Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work2011
- Online Scheduling on Identical Machines using SRPT2011
- The Geometry of Scheduling2010
- Longest Wait First for Broadcast Scheduling [Extended Abstract]2010
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of ServiceSIAM Journal on Computing, 2010
- Greedy multiprocessor server schedulingOperations Research Letters, 2005
- Multi-processor scheduling to minimize flow time with ε resource augmentation2004
- Approximation Algorithms for Average Stretch SchedulingJournal of Scheduling, 2004
- Approximation schemes for preemptive weighted flow time2002