A Branch-and-Bound Approach for a Two-Machine Flowshop Scheduling Problem
针对双机流水车间调度问题，提出一种分支定界算法，通过优化排序来最小化完工时间，适用于生产计划与调度领域的研究者。
Amit Nagar, Sunderesh S. Heragu, Jorge Haddock, A Branch-and-Bound Approach for a Two-Machine Flowshop Scheduling Problem, The Journal of the Operational Research Society, Vol. 46, No. 6 (Jun., 1995), pp. 721-734