Scheduling repetitive projects using the economic scheduling path procedure Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/t148fm26h

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Economic Scheduling Path (ESP) is an extension to the Critical Path Method. It was developed by Professors Riggs and Inoue of Oregon State University to effectively optimize resource utilization in repeated projects. This paper summarizes the Economic Scheduling Path terminology, ladder network representations, algorithms, and progress charts as originally presented in "ESP: Economic Scheduling Path A Network-Based Management Tool for Repetitive Projects" by Riggs and Inoue in May, 1971. Extensions are developed to expand the usefulness of ESP to include variable operation times, multiple crew processes, nonidentical replication, multiple operation crews, and single operation processes. An alternative to the ladder network is proposed enabling all ESP calculations to be performed on a modified critical path network. Algorithms for manual ESP calculation from the modified CPM networks are presented. A computer program, *ESP, is developed and programmed in FORTRAN IV. *ESP incorporates the algorithms used for manual calculation and the extensions, enabling it to establish boundary conditions and assist in evaluating resource assignments. Numerical examples are used throughout the paper to illustrate the steps of the various algorithms. The paper concludes with two larger examples demonstrating the algorithms used in combination.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Katy Davis(kdscannerosu@gmail.com) on 2014-02-17T18:52:50Z (GMT) No. of bitstreams: 1 SprengerDonaldL1972.pdf: 1060892 bytes, checksum: 1fb8e24906d596398130bcfbe600774a (MD5)
  • description.provenance : Submitted by Madison Medley (mmscannerosu@gmail.com) on 2014-02-13T22:52:51Z No. of bitstreams: 1 SprengerDonaldL1972.pdf: 1060892 bytes, checksum: 1fb8e24906d596398130bcfbe600774a (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2014-02-14T15:43:36Z (GMT) No. of bitstreams: 1 SprengerDonaldL1972.pdf: 1060892 bytes, checksum: 1fb8e24906d596398130bcfbe600774a (MD5)
  • description.provenance : Made available in DSpace on 2014-02-17T18:52:50Z (GMT). No. of bitstreams: 1 SprengerDonaldL1972.pdf: 1060892 bytes, checksum: 1fb8e24906d596398130bcfbe600774a (MD5) Previous issue date: 1972-04-06

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items