Index Catalog // ScholarsArchive@OSU

Resource planning of a high technology company under risk and uncertainty

Creator:: Jain, Pravin J.
Abstract:: A multi-phase methodology is proposed as an aid to resource planning and management activities in a high technology company faced with an uncertain marketing future. An attempt is made to incorporate both quantifiable and non-quantifiable factors. The problem analysis phase of the proposed methodology employs Resource Planning and Management (RPM)...
Resource Type:: Masters Thesis
Full Text:: and uncertainty AN ABSTRACT OF THE THESIS OF PRAVIN J. JAIN for the degree MASTER OF SCIENCE (Name

The application of decomposition and condensation algorithms to the logical design of resource planning and management (RPM) networks

Creator:: Chen, Kuei-Lin
Abstract:: Resource Planning and Management (RPM) network is a graphical representation of input-output relationships among activities and resources within a system. Both resources (events) and activities (decisions) are explicitly represented as nodes in all RPM networks. Depending upon the relationships being depicted, RPM networks can be classified into Relational (R), Precedence...
Resource Type:: Masters Thesis
Full Text:: for the BEA program, Appendix J contains descriptions of program options, Appendix K contains

A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network

Creator:: Stavrakis, George D.
Abstract:: 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...
Resource Type:: Dissertation
Full Text:: FACTORIZING OF BASIC PATHS ON RPM NETWORK Approved: Redacted for privacy Dr. Michael S. Inoue A new method

Minimum cost scheduling of resource constrained jobs on parallel machines under control of interchangeable processors

Creator:: Ng, George Kwok Wing
Abstract:: A special case of a parallel multiprocessor scheduling (MP) problem is investigated. A set of jobs with a known process time and a.resource requirement is scheduled on machines controlled by processors,and the total changeover cost between jobs is to be minimized. Each processor may control up to two machines and...
Resource Type:: Masters Thesis
Full Text:: ) Airth for George Kwok Wing Ng ACKNOWLEDGMENTS I am deeply indebted to Dr. Michael S. Inoue for his

Implementation of revised simplex Thompson algorithm on a limited core stand alone processor

Creator:: Chakravarty, Jyotirmoy
Abstract:: This thesis presents a linear programming package that uses an algorithm and data storage method efficient enough to solve a medium sized linear programming problem (250 variables and 100 constraints) on a minicomputer with small core memory space (4000 bytes). In this routine the problem is formulated by the use...
Resource Type:: Masters Thesis
Full Text:: patience ACKNOWLEDGEMENTS I wish to express my sincere gratitude to Dr. Michael S. Inoue for his

Development and experimental evaluation of branch-and-bound algorithms for determining optimum static job-shop production schedules

Creator:: Ramalingam, P. Rama, 1941-
Abstract:: 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...
Resource Type:: Dissertation
Full Text:: approved: Redacted for Privacy Dr. Michael S. Inoue Branch-and-Bound algorithms are developed to optimally

Multiperiod multiple-item dynamic lot sizing problem when discounts are available

Creator:: Chang, Chia-hao
Abstract:: 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...
Resource Type:: Dissertation
Full Text:: follows: 1. There are K items involved. th 2. Demand for . item at j t h period, D..ji ,is

Determination of optimal supply points in centralized distribution systems

Creator:: Matsuda, Yoichi
Abstract:: The determination of the number and locations of optimal supply points in centralized distribution systems is considered from both theoretical and institutional aspects. The Euclidean distance problems that typify the theoretical school of location search are discussed and seven different solution techniques are investigated: the Torricelli, linear programming, exhaustive search,...
Resource Type:: Masters Thesis
Full Text:: for Yoichi Matsuda ACKNOWLEDGMENT I would like to especially thank Dr. Michael S. Inoue for his

Extending the planning capability of zerobase and flexible budgeting through the use of RPM networks and optimization techniques

Creator:: Lomelin-Zarate, Jose David
Abstract:: The viability of incorporating optimization within budgeting methodologies is examined. Resource Planning and Management System and optimization are proposed as tools to enhance the planning and control functions of the budgeting process. Three hypotheses are proposed: (1) Integer Programming, Integer Goal Programming and Dynamic Programming can be substituted in place...
Resource Type:: Masters Thesis
Full Text:: . Michael S. Inoue; as my advisor, he has offered me an invaluable combination of challenge and

Heuristic scheduling of orders with due dates and sequence dependent set-up times

Creator:: Joshi, Sudhir Madhukar
Resource Type:: Masters Thesis
Full Text:: Approved: Redacted for privacy //' c' Dr. Michael S.-Inoue Order Scheduling is proposed as a new class of

ScholarsArchive@OSU

Resource planning of a high technology company under risk and uncertainty

The application of decomposition and condensation algorithms to the logical design of resource planning and management (RPM) networks

A general linear optimization algorithm based upon labeling and factorizing of basic paths on RPM network

Minimum cost scheduling of resource constrained jobs on parallel machines under control of interchangeable processors

Implementation of revised simplex Thompson algorithm on a limited core stand alone processor

Development and experimental evaluation of branch-and-bound algorithms for determining optimum static job-shop production schedules

Multiperiod multiple-item dynamic lot sizing problem when discounts are available

Determination of optimal supply points in centralized distribution systems

Extending the planning capability of zerobase and flexible budgeting through the use of RPM networks and optimization techniques

Heuristic scheduling of orders with due dates and sequence dependent set-up times

Limit your search

Academic Affiliation

Advisor

Commencement Year

Committee Member

Creator

Date

Decade

Degree Field

Degree Level

Degree Name

File Format

Language

Non-Academic Affiliation

Peer Reviewed

Resource Type

Rights Statement

Subject

Search Constraints

Search Results

Limit your search