Robust absolute single machine makespan scheduling-location problem on trees.
Sven O. KrumkeLe Huy MinhPublished in: Oper. Res. Lett. (2020)
Keyphrases
- single machine
- scheduling problem
- release dates
- scheduling jobs
- minimize total
- processing times
- release times
- maximum lateness
- deteriorating jobs
- weighted tardiness
- sequence dependent setup times
- flowshop
- earliness tardiness
- setup times
- identical machines
- total weighted tardiness
- total tardiness
- job processing times
- single machine scheduling problem
- rolling horizon
- parallel machines
- production scheduling
- precedence constraints
- completion times
- job shop
- np hard
- learning effect
- tabu search
- competitive ratio
- dynamic programming
- makespan minimization
- minimizing makespan
- resource allocation
- search algorithm