Advertisement

Efficient Solution Procedures for Certain Scheduling and Sequencing Problems

  • L. G. Mitten
  • C. A. Tsou
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 86)

Abstract

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 [7] — and computational experience with recursive procedures has generally been quite disappointing. Dynmaic programming has been of very limited utility (e.g., see [4] and the comments of [8] on [2]). Branch and bound methods, although frequently proposed (e.g., see [1] and [6]), have generally not been efficient enough to provide a practical solution procedure.

Keywords

Solution Procedure Sequencing Problem Project Schedule Problem Implicit Enumeration Optimal Permutation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agin, M., “Optimum Seeking with Branch and Bound”, Mgt.Sc., Vol. 13 (1966), B176–B185.Google Scholar
  2. 2.
    Butcher, W. S., Y.Y. Haimes, and W.A. Hall, “Dynamic Programming for the Optimal Sequencing of Water Supply Projects”, Water Resources Research, Vol. 5 (1969), pp. 1196–1204.CrossRefGoogle Scholar
  3. 3.
    Hardy, G. H., J. E. Littlewood, and G. Bolya, Inequalities, Cambridge University Press, 1934.Google Scholar
  4. 4.
    Held, M. and R. M. Karp, “A Dynamic Programming Approach to Sequencing Problems”, Jour. Sec. Ind. and Appl. Math., Vol. 10, No. 1 (March, 1962), pp. 196–210.CrossRefGoogle Scholar
  5. 5.
    Johnson, S.M., “Optimal Two and Three Stage Production Schedules with Setup Times Included”, Nav. Res. Log. Quart., Vol. 1, No. 1 (March, 1954), pp. 61–68.CrossRefGoogle Scholar
  6. 6.
    Lawler, E. L. and D. E. Wood, “Branch and Bound Methods: A Survey”, Opns.Res., Vol. 14 (1966), pp. 669–719.Google Scholar
  7. 7.
    Rau, J. G., “Minimizing a Function of Permutations of n Integers”, Opns.Res., Vol. 19, No. 1 (Jan.-Feb., 1971), pp. 237–240.CrossRefGoogle Scholar
  8. 8.
    Erlenketter, D., “The Sequencing of Expansion Projects”, Working Paper No. 166, Western Management Science Institute, UCLA, (Nov., 1970).Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1973

Authors and Affiliations

  • L. G. Mitten
    • 1
  • C. A. Tsou
    • 1
  1. 1.The University of British ColumbiaVancouverCanada

Personalised recommendations