Research Reports from the Department of Operations
Document Type
Dissertation
Publication Date
9-1-1971
Abstract
This study addresses itself to the scheduling and sequencing aspects of some major capital expenditure planning problems. Specifically, several models for the scheduling and sequencing of systems of durable, high-cost ("one-shot") projects, which in the aggregate are subject to a number of continuous-time demand requirements, are formulated and analyzed. Project selection, sequencing and timing decisions which constitute minimum-cost strategies are determined for various identifiable cases via mathematical programming. In particular, the special structure of this class of continuous time combinatorial decision problems is exploited, leading to the development of several efficient dynamic programming algorithms for the solution of deterministic multi-dimensional scheduling problems. An implicit enumeration by branch and bound algorithm is also developed for deterministic cases. Furthermore, sufficient conditions for myopic scheduling techniques are presented and the solution algorithms are tested on a number of realistic problems of various sizes. Stochastic scheduling problems are also formulated and analyzed and an extensive bibliography is included.
Keywords
Operations research, Programming (Mathematics), Capital investments--Mathematical models, Production scheduling, Stochastic processes
Publication Title
Dissertation/Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 242 ; Submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy.
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Morin, Thomas L., "Optimal Scheduling of One-Shot Projects" (1971). Research Reports from the Department of Operations. 397.
https://commons.case.edu/wsom-ops-reports/397