Scheduling Multi-Server Jobs With Sublinear Regrets via Online Learning.
Hailiang ZhaoShuiguang DengZhengzhe XiangXueqiang YanJianwei YinSchahram DustdarAlbert Y. ZomayaPublished in: IEEE Trans. Serv. Comput. (2024)
Keyphrases
- online learning
- parallel machines
- identical machines
- identical parallel machines
- scheduling problem
- job scheduling
- processing times
- release dates
- unrelated parallel machines
- scheduling strategy
- minimize total
- optimal scheduling
- release times
- wafer fabrication
- scheduling algorithm
- precedence constraints
- scheduling jobs
- computational grids
- flowshop
- deteriorating jobs
- single machine scheduling problem
- single machine
- weighted tardiness
- scheduling policies
- setup times
- fixed number
- distance education
- batch processing
- blended learning
- precedence relations
- maximum lateness
- e learning
- computer mediated
- sequence dependent setup times
- online course
- round robin
- scheduling decisions
- higher education
- batch processing machines
- production scheduling
- online algorithms
- grid computing
- distance learning
- resource allocation
- np hard
- polynomial time approximation
- classroom learning
- job shop scheduling problem
- limited capacity
- load balancing
- active learning
- data sets