IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Optimal Sequential Assignments with Random Arrival Times

Listed author(s):
  • S. Christian Albright

    (Indiana University)

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 21 (1974)
    Issue (Month): 1 (September)
    Pages: 60-67

    in new window

    Handle: RePEc:inm:ormnsc:v:21:y:1974:i:1:p:60-67
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:21:y:1974:i:1:p:60-67. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.