A new method is developed for solving linear optimization
problems based on the RPM network modeling technique which represents
the primal and the corresponding dual models simultaneously
upon a single graph. The network structure is used to eliminate
the need for explicit logical variables and to provide a graphic
tool...
Branch-and-Bound algorithms are developed to optimally
schedule static single- and multi-stage job-shop productions. The 'corollary' of the study is to experimentally verify the effectiveness of
branch-and-bound algorithms to overcome the "curse of dimensionality" due to the combinatorial nature of job-shop scheduling problems.
The static scheduling problem contemplated in this dissertation...
This thesis extends Wagner-Whitin's Planning Horizon Theorem
to discount situations in multiperiod multiple-item dynamic lot sizing
problems. Three heuristic techniques are developed using the Least
Unit Cost Method, Silver-Meal Method, and Inoue-Chang Method. The
three techniques are described and compared in terms of their effectiveness
in dealing with the dynamic...
This dissertation treats information theory and its applications
to the general area of decision making. Specifically, three areas are
covered; (1) information theory applied to Bayesian analysis,
(2) estimation using multi-factor information channel models, and
(3) information theory applied to Markov chain analysis.
A major portion of this dissertation concerns...
This dissertation is an attempt at developing a method for the analysis and estimation of the effects of disruptions due to uncertainties. Such uncertainties may result from design changes and engineering drawing delays in large-scale, complex, research and development, or construction projects.
In order to provide management with a simple...