Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times.
Jianchao LuoZhiqiang LiuKeyi XingPublished in: Int. J. Prod. Res. (2019)
Keyphrases
- setup times
- branch and bound algorithm
- scheduling problem
- precedence constraints
- np hard
- single machine scheduling problem
- lagrangian relaxation
- strongly np hard
- manufacturing cell
- lower bound
- branch and bound
- sequence dependent setup times
- optimal solution
- flowshop
- single machine
- upper bound
- processing times
- unrelated parallel machines
- release dates
- combinatorial optimization
- total tardiness
- approximation algorithms
- multi item
- integer programming
- haplotype inference
- search algorithm
- manufacturing systems
- parallel machines
- knapsack problem
- partial order
- state space
- cost function
- objective function
- neural network