Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks.
Michael DinitzBenjamin MoseleyPublished in: INFOCOM (2020)
Keyphrases
- completion times
- scheduling problem
- single machine
- weighted sum
- processing times
- single machine scheduling problem
- release times
- absolute deviation
- open shop
- flowshop
- unrelated parallel machines
- sum of completion times
- queue length
- shortest processing time
- resource consumption
- release dates
- number of late jobs
- differentiated services
- steady state
- genetic algorithm
- computational efficiency
- np hard
- multi objective