Accession Number : ADA190823
Title : Discrete Generalized Networks: Application to Integer Constrained Flow Problems.
Descriptive Note : Final rept. 15 Apr 85-14 Oct 87,
Corporate Author : NORTH CAROLINA ARGICULTURAL AND TECHNICAL STATE UNIV GREENSBORO
Personal Author(s) : Sarin, Sanjiv
PDF Url : ADA190823
Report Date : 15 Oct 1987
Pagination or Media Count : 29
Abstract : A generalized network structure is essentially a linear program whose coefficient matrix ignoring simple bounds on variables, contains at most two- non-zero entries in each column. When flow variables are required to be integers, the resulting problem is termed Discrete Generalized Network (DGN). The DGN structure has been used to model problems such as scheduling variable length networks, designing communication networks and capital allocation problems. The primary objective of this project has been to identify solution methodologies for problems having the DGN structure. Some secondary outcomes of the research include a program for generating random networks and an application of DGN formulation to model an important problem in flexible manufacturing systems. Keywords: Linear programs; Discrete generalized network; Manufacturing systems; Random networks.
Descriptors : *ALLOCATIONS, *LINEAR PROGRAMMING, *MANUFACTURING, *MODELS, *NETWORKS, COMMUNICATIONS NETWORKS, FLOW, FORMULATIONS, INTEGER PROGRAMMING, LENGTH, METHODOLOGY, NUMBERS, SCHEDULING, SOLUTIONS(GENERAL), VARIABLES
Subject Categories : Mfg & Industrial Eng & Control of Product Sys
Distribution Statement : APPROVED FOR PUBLIC RELEASE