Optimal Sequential Assignments with Random Arrival Times

S. Christian Albright
Additional contact information
S. Christian Albright: Indiana University

Management Science, 1974, vol. 21, issue 1, 60-67

Abstract: A problem is considered where jobs arrive at random times and assume random values, or importance. These must be assigned to a fixed set of men whose qualities are different but known. As each job arrives, its value is observed and the decision-maker must decide which man, if any, to assign to this job. If a job arrives at time t and its value is observed to be x, then by assigning man i with quality p i , a reward r(t)p i x is received, where r(t) is a discount function. The object is to find an assignment policy which maximizes the expected reward from the available men. The problem is analyzed for different arrival distributions and for different discount functions, but in all cases, the optimal policies are shown to have fairly simple forms, independent of the actual qualities of the men, the p i 's. Other interpretations of the model, besides the men and jobs interpretation, are also given. The paper concludes with a similar model which does not, however, include time as an explicit parameter.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.1.60 (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:ormnsc:v:21:y:1974:i:1:p:60-67

Access Statistics for this article

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