A MATHEMATICAL FORMULATION AND SOLUTION OF A MULTIPLE-RESOURCE SCHEDULING PROBLEM
Abstract
An algorithm is proposed for determining optimal ways of scheduling multiple operations, each of which must be serviced by a number of resources simultaneously. The objective is to allocate the resources on a time-scale such that all the de sired operations may be completed in the minimum time possible. By means of a selective searching procedure, the algorithm in effect considers all possible allocations but in much less time than direct enumeration would entail. The result is an optimal schedule or time sequence for operations. The basic inputs to the algorithm are each operation's time requirements on each type of resource and a statement of the resources which the servicing system has available for allocation. The procedure is deterministic in the sense that the operational time requirements, which are in truth probabilistic, are assumed to be known exactly. The algorithm was developed as a possible means for scheduling operations on the Pacific Missile Range. In that context, the many operations and even greater number of resource types which must be considered necessitate the use of a large-scale digital computer to execute the algorithm.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 31, 1963
- Accession Number
- AD0403342
Entities
People
- R. V. Skarda Jr.