Year of publication
- 2008 (1) (remove)
- On the benefits of using NP-hard problems in Branch & Bound (2008)
- We present a Brand-and-Bound (B&B) method using combinatorial bounds for solving makespan minimization problems with sequence dependent setup costs. As an application we present a laser source sharing problem arising in car manufacturing.