On $(1, ε)$-Restricted Assignment Makespan Minimization.
Deeparnab ChakrabartySanjeev KhannaShi LiPublished in: CoRR (2014)
Keyphrases
- makespan minimization
- scheduling problem
- job shop scheduling problem
- parallel machines
- processing times
- special case
- metaheuristic
- single machine
- polynomially solvable
- polynomial time approximation
- flowshop
- total weighted tardiness
- setup times
- job shop scheduling
- np hard
- np complete
- release dates
- tabu search
- sequence dependent setup times
- optimization problems
- precedence constraints
- lagrangian relaxation
- single machine scheduling problem
- branch and bound algorithm
- ant colony optimization
- linear programming
- simulated annealing
- minimum cost
- genetic algorithm
- job shop
- search space