Scheduling Multi-Server Jobs with Sublinear Regrets via Online Learning.
Hailiang ZhaoShuiguang DengZhengzhe XiangXueqiang YanJianwei YinSchahram DustdarAlbert Y. ZomayaPublished in: CoRR (2023)
Keyphrases
- online learning
- identical parallel machines
- parallel machines
- minimize total
- identical machines
- job scheduling
- scheduling problem
- release dates
- unrelated parallel machines
- scheduling strategy
- optimal scheduling
- processing times
- weighted tardiness
- setup times
- precedence constraints
- computational grids
- scheduling jobs
- batch processing
- scheduling algorithm
- scheduling policies
- release times
- single machine
- wafer fabrication
- fixed number
- precedence relations
- round robin
- single machine scheduling problem
- competitive ratio
- sequence dependent setup times
- scheduling decisions
- online algorithms
- deteriorating jobs
- distance education
- batch processing machines
- online course
- flowshop
- maximum lateness
- list scheduling
- computer mediated
- limited capacity
- higher education
- e learning
- strongly np hard
- load balancing
- machine learning
- classroom learning
- completion times
- grid computing
- blended learning
- branch and bound algorithm
- distance learning
- resource allocation
- np hard
- training data
- shortest processing time