Online Makespan Minimization: The Power of Restart.
Zhiyi HuangNing KangZhihao Gavin TangXiaowei WuYuhao ZhangPublished in: APPROX-RANDOM (2018)
Keyphrases
- makespan minimization
- parallel machines
- scheduling problem
- special case
- job shop scheduling problem
- random walk
- processing times
- single machine
- flowshop
- np complete
- total weighted tardiness
- polynomially solvable
- metaheuristic
- release dates
- polynomial time approximation
- linear programming
- dynamic programming
- np hard
- cost function