Online Makespan Minimization with Budgeted Uncertainty.
Susanne AlbersMaximilian JankePublished in: WADS (2021)
Keyphrases
- greedy algorithm
- makespan minimization
- online algorithms
- worst case
- processing times
- scheduling problem
- metaheuristic
- special case
- online learning
- single machine
- parallel machines
- total weighted tardiness
- job shop scheduling problem
- flowshop
- polynomially solvable
- neural network
- setup times
- upper bound
- precedence constraints
- tabu search
- release dates
- polynomial time approximation