On Scheduling Coflows
- 15 July 2020
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 82 (12) , 3604-3629
Abstract
No abstract availableKeywords
Funding Information
- Division of Computer and Network Systems (156019)
- Division of Computing and Communication Foundations (1655073 (Eager))
- Amazon
This publication has 20 references indexed in Scilit:
- Efficient coflow scheduling with VarysACM SIGCOMM Computer Communication Review, 2014
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machineOperations Research Letters, 2013
- Minimizing the sum of weighted completion times in a concurrent open shopOperations Research Letters, 2010
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling ProblemsLecture Notes in Computer Science, 2010
- MapReduceCommunications of the ACM, 2008
- Supply Chain Scheduling: Conflict and Cooperation in Assembly SystemsOperations Research, 2007
- Customer order scheduling to minimize total weighted completion timeOmega, 2007
- Scheduling orders for multiple product types to minimize total weighted completion timeDiscrete Applied Mathematics, 2007
- Order Scheduling Models: Hardness and Algorithms2007
- Structure of a simple scheduling polyhedronMathematical Programming, 1993