Efficient Solution Procedures for Certain Scheduling and Sequencing Problems
The solution of scheduling and sequencing problems has in most cases proved to involve serious difficulties. Direct solution methods are available only for problems of very special structure — e.g., see  — and computational experience with recursive procedures has generally been quite disappointing. Dynmaic programming has been of very limited utility (e.g., see  and the comments of  on ). Branch and bound methods, although frequently proposed (e.g., see  and ), have generally not been efficient enough to provide a practical solution procedure.
Unable to display preview. Download preview PDF.
- 1.Agin, M., “Optimum Seeking with Branch and Bound”, Mgt.Sc., Vol. 13 (1966), B176–B185.Google Scholar
- 3.Hardy, G. H., J. E. Littlewood, and G. Bolya, Inequalities, Cambridge University Press, 1934.Google Scholar
- 6.Lawler, E. L. and D. E. Wood, “Branch and Bound Methods: A Survey”, Opns.Res., Vol. 14 (1966), pp. 669–719.Google Scholar
- 8.Erlenketter, D., “The Sequencing of Expansion Projects”, Working Paper No. 166, Western Management Science Institute, UCLA, (Nov., 1970).Google Scholar