A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time.
Sungjin ImManish PurohitPublished in: CoRR (2017)
Keyphrases
- scheduling problem
- parallel machines
- completion times
- single machine
- release times
- release dates
- identical parallel machines
- maximum lateness
- processing times
- identical machines
- precedence constraints
- approximation algorithms
- scheduling jobs
- lower bound
- upper bound
- np hard
- sequence dependent setup times
- flow patterns
- single machine scheduling problem
- error bounds
- fixed number
- setup times
- scheduling algorithm
- polynomial time approximation
- convex functions
- job shop scheduling problem
- round robin
- resource allocation
- dynamic programming
- flowshop
- queueing networks
- worst case
- job shop
- flexible manufacturing systems
- real time database systems
- approximation error