AN APPROACH TO THE SEQUENCING OF RANGE OPERATIONS
Abstract
This report is one of a series which consider the problems of attempting to use a digital computer as an aid in scheduling operations at the Pacific Missile Range. A theoretical treatment of one portion of the mathematical problem of scheduling is presented herein. This portion of the problem is the sequencing or ordering of compound operations on a time scale. A compound operation is a set of individual operations which can be scheduled simultaneously. The objective of the sequencing process is to arrange the operations such that the running time for the operations is minimized. Under certain assumptions, it is shown that the sequencing problem is the same as the classical traveling salesman problem. The technique of dynamic programming is discussed as a means of finding an optimal or near-optimal sequence and the problem is formulated in that structure. As developed, the model can accommodate demands for resource time which vary as a function of the ordering of operations and can incorporate priority rules for operations which must be scheduled within a certain time period of the day.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 23, 1963
- Accession Number
- AD0402612
Entities
People
- C. E. Wisler