Tighter Bounds for Makespan Minimization on Unrelated Machines.
Dor AradYael MordechaiHadas ShachnaiPublished in: CoRR (2014)
Keyphrases
- makespan minimization
- parallel machines
- flowshop
- upper bound
- scheduling problem
- lower bound
- processing times
- metaheuristic
- sequence dependent setup times
- special case
- polynomially solvable
- job shop scheduling problem
- total weighted tardiness
- polynomial time approximation
- single machine
- np hard
- setup times
- parallel computing
- error bounds
- shared memory
- tabu search
- np complete
- precedence constraints
- release dates
- lot sizing
- branch and bound
- worst case
- sample complexity
- job shop
- neural network
- single server
- lower and upper bounds
- combinatorial optimization problems
- multi objective
- cost function