Accession Number : AD0761668
Title : Selecting a Process Monitor Schedule with Multiple Resource Constraints.
Descriptive Note : Technical rept.,
Corporate Author : UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Personal Author(s) : Pfister,Henry L.
Report Date : JUN 1973
Pagination or Media Count : 14
Abstract : With plans to use time-sharing computers to control several simultaneous processes, the problem of scheduling the process sensors in a sample data control system is of increasing practical importance. The difficulties in scheduling arise from the necessity of sequencing optimal sensor combinations and from the optimal management of the system resources. In general the utility of a combination of sensors is not the sum of the individual utilities. Furthermore resource constraints are for long term utilization of the system. A sequencing and scheduling technique is described for this problem using a forward dynamic programming algorithm. The use of a forward algorithm allows the proof of a horizon theorem to find optimal time points to stop the scheduling process. (Modified author abstract)
Descriptors : (*DATA PROCESSING, *SCHEDULING), ALGORITHMS, TIME SHARING, DYNAMIC PROGRAMMING, MATHEMATICAL MODELS
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE