TITLE

SOME NOTES ON THE SIMILARITY OF THREE MANAGEMENT SCIENCE MODELS AND THEIR ANALYSIS BY CONNECTIVITY MATRIX TECHNIQUES

AUTHOR(S)
Steinberg, Alan W.
PUB. DATE
January 1963
SOURCE
Management Science;Jan1963, Vol. 9 Issue 2, p341
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Certain Properties of Connectivity Matrices are noted to be similarly applicable to Three Management Science Models which have hitherto been investigated as independent structures: (1) PERT Network Analysis; (2) Parts Explosion Techniques; and (3) Business System Data Flow Analysis. These properties suggest some computational techniques which should be helpful in the analysis of systems described by the three models.
ACCESSION #
7451920

 

Related Articles

  • AN ALGEBRA FOR THE ANALYSIS OF GENERALIZED ACTIVITY NETWORKS. Elmaghraby, Salah E. // Management Science;Apr1964, Vol. 10 Issue 3, p494 

    This paper generalizes the approach of activity networks, exemplified by PERT and CPM, to networks in which activates and events occur probabilistically and contain logical relationships of a more complicated nature. For example, from a specific event some activities are undertaken with...

  • FACTORS AFFECTING THE SUCCESSFUL APPLICATION OF PERT/CPM SYSTEMS IN A GOVERNMENT ORGANIZATION. Dane, C. W.; Gray, C. F.; Woodworth, B. M. // Interfaces;Nov79, Vol. 9 Issue 5, p94 

    PERT/CPM in project management scheduling systems is applied and used less frequently than the literature would seem to suggest. Eighteen almost-identical government units were studied to document a situation that appears to be ideally suited to PERT/CPM but where the success ratio was 4 out of...

  • On 2-stage robust LP with RHS uncertainty: complexity results and applications. Minoux, Michel // Journal of Global Optimization;Mar2011, Vol. 49 Issue 3, p521 

    We investigate here the class-denoted R-LP-RHSU-of two-stage robust linear programming problems with right-hand-side uncertainty. Such problems arise in many applications e.g: robust PERT scheduling (with uncertain task durations); robust maximum flow (with uncertain arc capacities); robust...

  • A Job-Shop Scheduling Model of Software Development Planning for Constraint-based Local Search. Barba, Irene; del Valle, Carmelo // International Journal of Software Engineering & Its Applications;Oct2010, Vol. 4 Issue 4, p1 

    Software development planning usually does not take any advantage of planning and scheduling techniques involving reasoning about time and resources, which are typical in the manufacturing area. This paper proposes a constraint-based model for the Job Shop Scheduling Problem to be solved using...

  • THE THEORY OF NETWORKS AND MANAGEMENT SCIENCE: PART II. Elmaghraby, Salah E. // Management Science;Oct70, Vol. 17 Issue 2, pB-54 

    The article focuses on the critical path method (CPM), an activity network in which the duration of each activity is a fixed constant. A brief overview of the precedence relationship among activities and their duration is presented, and several methods for analyzing activity networks are...

  • THE EFFECT OF WORKLOAD DEPENDENT DUE-DATES ON JOB SHOP PERFORMANCE. Bertrand, J. W. M. // Management Science;Jul1983, Vol. 29 Issue 7, p799 

    This study explores the due-date performance of job shop control systems which base job due dates on a time-phased representation of the workload and the machine capacity in the shop. The performance is measured by the mean and the standard deviation of the lateness. Two parameters are used to...

  • A GENERAL FRAMEWORK FOR MODELING PRODUCTION. Hackman, Steven T.; Leachman, Robert C. // Management Science;Apr89, Vol. 35 Issue 4, p478 

    We introduce a general framework that guides the management scientist's formulation of deterministic models of production processes. Using the framework, we reformulate the constraints of familiar linear programming-based planning models to specifically treat components of production lead time,...

  • A VARIATIONAL STUDY OF OPTIMAL RESOURCE PROFILES. Cullingford, G.; Prideaux, J. D. C. // Management Science;May73, Vol. 19 Issue 9, p1067 

    The paper describes a method of supplementing network analysis by taking a global view of project planning. The sequencing constraints normally found in a project are condensed into restrictions on the quantity of work performed by any stage in its duration. The objective is to minimise cost,...

  • Distributed Research Project Scheduling Based on Multi-Agent Methods. Bodea, Constanta-Nicoleta; Badea, Ileana Ruxandra; Purnu┼×, Augustin // Journal of Applied Computer Science & Mathematics;2011, Issue 10, p20 

    Different project planning and scheduling approaches have been developed. The Operational Research (OR) provides two major planning techniques: CPM (Critical Path Method) and PERT (Program Evaluation and Review Technique). Due to projects complexity and difficulty to use classical methods, new...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics