Lower bounds for the makespan minimization in job shops.
Yacine BenzianiImed KacemPierre LarocheAnass NagihPublished in: ICNSC (2013)
Keyphrases
- makespan minimization
- lower bound
- processing times
- flowshop
- scheduling problem
- release dates
- single machine scheduling problem
- branch and bound algorithm
- np hard
- upper bound
- polynomially solvable
- total weighted tardiness
- single machine
- job processing times
- sequence dependent setup times
- branch and bound
- job shop scheduling problem
- precedence constraints
- parallel machines
- special case
- setup times
- metaheuristic
- lower and upper bounds
- worst case
- job shop
- polynomial time approximation
- tabu search
- optimal solution
- lagrangian relaxation
- np complete
- objective function
- search algorithm
- linear programming relaxation
- multi objective
- combinatorial optimization problems
- linear programming
- vehicle routing problem