A branch and bound method for the job-shop problem with sequence-dependent setup times.
Christian ArtiguesDominique FeilletPublished in: Ann. Oper. Res. (2008)
Keyphrases
- branch and bound method
- sequence dependent setup times
- branch and bound algorithm
- single machine scheduling problem
- precedence constraints
- flowshop
- scheduling problem
- mixed integer programming
- lot sizing
- branch and bound
- job shop scheduling problem
- lower bound
- single machine
- feasible solution
- setup times
- tabu search
- job shop
- release dates
- parallel machines
- np hard
- lagrangian relaxation
- optimal configuration
- reduce the search space
- optimal solution
- combinatorial optimization
- upper bound
- multi item
- search algorithm
- processing times
- special case
- multistage
- setup cost
- search space
- production planning
- objective function
- lead time
- neural network
- bayesian networks
- metaheuristic
- genetic algorithm
- lower and upper bounds
- memetic algorithm
- linear programming