A Resource Allocation Problem

Socrates Litsios
Additional contact information
Socrates Litsios: Booz-Allen Applied Research, Bethesda, Maryland

Operations Research, 1965, vol. 13, issue 6, 960-988

Abstract: In this paper two sequencing problems are investigated that arise in the course of allocating one or more constrained resources to two or more tasks. The general problem considered is one of determining the optimal sequence of tasks and the optimal scheduling of resource usage where the objective is to minimize the time by which all tasks are completed. The fundamental solution technique utilized involves a combination of dynamic programming and combinatorial analysis techniques. In the single resource case the two problems are shown to be graphical “duals” of each other thereby allowing an iterative solution to the second problem.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.6.960 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:13:y:1965:i:6:p:960-988

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().