Online Makespan Minimization with Parallel Schedules.
Susanne AlbersMatthias HellwigPublished in: Algorithmica (2017)
Keyphrases
- makespan minimization
- scheduling problem
- parallel machines
- processing times
- single machine
- flowshop
- job shop scheduling problem
- total weighted tardiness
- special case
- metaheuristic
- dynamic programming
- parallel computing
- setup times
- polynomial time approximation
- polynomially solvable
- shortest path
- single server
- release dates