IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v124y2003i1p15-3310.1023-banor.0000004760.20323.fc.html
   My bibliography  Save this article

Some Fixed-Point Results for the Dynamic Assignment Problem

Author

Listed:
  • Michael Spivey
  • Warren Powell

Abstract

In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Michael Spivey & Warren Powell, 2003. "Some Fixed-Point Results for the Dynamic Assignment Problem," Annals of Operations Research, Springer, vol. 124(1), pages 15-33, November.
  • Handle: RePEc:spr:annopr:v:124:y:2003:i:1:p:15-33:10.1023/b:anor.0000004760.20323.fc
    DOI: 10.1023/B:ANOR.0000004760.20323.fc
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000004760.20323.fc
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/B:ANOR.0000004760.20323.fc?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. Gülpınar, Nalan & Çanakoğlu, Ethem & Branke, Juergen, 2018. "Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 291-303.

    More about this item

    Keywords

    dynamic assignment problem; fixed point;

    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:spr:annopr:v:124:y:2003:i:1:p:15-33:10.1023/b:anor.0000004760.20323.fc. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.