Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Production Research"
DOI: 10.1080/00207543.2018.1489156
Abstract: This article proposes hybrid branch and bound algorithms to minimise the makespan for the two-stage assembly scheduling problem with separated setup times. In the studied problem, there are multiple machines at the first stage, each… read more here.
Keywords: bound algorithms; hybrid branch; two stage; stage ... See more keywords