In this paper the branch and bound method proposed by G.H.Brooks et al. is improved for Job-Shop scheduling problems.The computation of bound below nodes is simplified and higher precision is gained. The associated software of this algorithm is c
Sui Jie Jiang Zuolian . , {{custom_author.name_en}}.
An Algorithm and Software Design for Job-Shop Poblems. Systems Engineering - Theory & Practice, 1991, 11(1): 0-0 https://doi.org/10.12011/1000-6788(1991)1-106356