IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v46y2014i11p1169-1180.html
   My bibliography  Save this article

The sequential stochastic assignment problem with random success rates

Author

Listed:
  • Arash Khatibi
  • Golshid Baharian
  • Estelle R. Kone
  • Sheldon H. Jacobson

Abstract

Given a finite number of workers with constant success rates, the Sequential Stochastic Assignment problem (SSAP) assigns the workers to sequentially arriving tasks with independent and identically distributed reward values, so as to maximize the total expected reward. This article studies the SSAP, with some (or all) workers having random success rates that are assumed to be independent but not necessarily identically distributed. Several assignment policies are proposed to address different levels of uncertainty in the success rates. Specifically, if the probability density functions of the random success rates are known, an optimal mixed policy is provided. If only the expected values of these rates are known, an optimal expectation policy is derived.

Suggested Citation

  • Arash Khatibi & Golshid Baharian & Estelle R. Kone & Sheldon H. Jacobson, 2014. "The sequential stochastic assignment problem with random success rates," IISE Transactions, Taylor & Francis Journals, vol. 46(11), pages 1169-1180, November.
    • Handle: RePEc:taf:uiiexx:v:46:y:2014:i:11:p:1169-1180
    DOI: 10.1080/0740817X.2014.882530
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2014.882530
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2014.882530?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jorge A. Sefair & J. Cole Smith, 2017. "Exact algorithms and bounds for the dynamic assignment interdiction problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(5), pages 373-387, August.
    2. Arash Khatibi & Golshid Baharian & Banafsheh Behzad & Sheldon Jacobson, 2015. "Extensions of the sequential stochastic assignment problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 317-340, December.
    3. David Bergman & Jason Imbrogno, 2017. "Surviving a National Football League Survivor Pool," Operations Research, INFORMS, vol. 65(5), pages 1343-1354, October.
    4. Arash Khatibi & Sheldon H. Jacobson, 2016. "Doubly Stochastic Sequential Assignment Problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 124-137, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:46:y:2014:i:11:p:1169-1180. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.