Author:
BELLMAN R.,ESOGBUE A.O.,NABESHIMA I.
Reference22 articles.
1. “A branch-and-bound algorithm for the exact solution of the three machine scheduling problem”;LOMNICKI;Opnl. Res. Quart.,1965
2. “Application of the branch and bound technique to some flow-shop scheduling problems”;IGNALL;Opns. Res.,1965
3. Z. A. LOMNICKI, op. cit. The standard lower bound for the three-machine case was presented in
4. E. IGNALL and L. SCHRAGE, op. cit.
5. Mathematical Aspects of Scheduling and Applications