Research Abstract on a Feasibility Approach to Optimal Schedules

  • Victor A. Zaloom
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 86)

Abstract

Optimization algorithms capable of efficiently solving general large scale resource scheduling problems do not exist. There are some specially structured scheduling problems for which optimization algorithms are available; for examples, see Johnson (3), Hu (2), and Chaudhuri (1). A slight extension of the problem discussed by Hu is presented here. First, a portion of Hu’s presentation in reference (2) will be discussed. The problem of interest which was solved in (2) had as its objective to minimize schedule duration under the following assumptions:
  1. (1)

    the project network diagram is a tree, (a tree is a graph containing no closed loops),

     
  1. (2)

    each activity requires unit time and a single resource common to each activity,

     
  1. (3)

    resources are available in integral numbers.

     

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chaudhuri, A. R., On the Problem of Critical Path Method,” OPSEARCH, p. 206–214, (1969).Google Scholar
  2. Hu, T. C., “Vparallel Sequencing and Assembly Line Balancing,” Operations Research, Vol. 9, p. 841–848, (1961).CrossRefGoogle Scholar
  3. Johnson, S. M., “Optimal Two-and-Three Stage Production Schedules with Setup Times Included,” Naval Research Logistics Quarterly, Vol. 1, No. 1, p. 61–68, (1954).CrossRefGoogle Scholar
  4. Zaloom, V. A., “An Examination of the Expected Minimum Time to Complete a Resource Constrained Project,” Unpublished Dissertation, University of Houston, p. 54, (1970).Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1973

Authors and Affiliations

  • Victor A. Zaloom
    • 1
  1. 1.Industrial Engineering DepartmentAuburn UniversityAuburnUSA

Personalised recommendations