Lower bounds for online makespan minimization on a small number of related machines.
Lukasz JezJarett SchwartzJirí SgallJózsef BékésiPublished in: J. Sched. (2013)
Keyphrases
- small number
- lower bound
- makespan minimization
- flowshop
- parallel machines
- upper bound
- scheduling problem
- online algorithms
- branch and bound algorithm
- worst case
- np hard
- job shop scheduling problem
- lower and upper bounds
- neural network
- processing times
- special case
- release dates
- total weighted tardiness
- objective function