IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v33y2018i2p239-255.html
   My bibliography  Save this article

An efficient methodology for robust assignment problem

Author

Listed:
  • Kais Zaman
  • Subrata Kumar Saha

Abstract

This paper proposes formulations and algorithms for assignment problem under natural or physical variability, from the perspective of robustness of the assignment. We formulate the robust assignment problem as a nonlinear binary programming problem. An equivalent linear binary programming formulation and a modified Hungarian approach are then proposed to achieve computational efficiency. The proposed methods are illustrated for two example problems, where the information on the problem parameters is available as their means and standard deviations.

Suggested Citation

  • Kais Zaman & Subrata Kumar Saha, 2018. "An efficient methodology for robust assignment problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 33(2), pages 239-255.
  • Handle: RePEc:ids:ijores:v:33:y:2018:i:2:p:239-255
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=95199
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijores:v:33:y:2018:i:2:p:239-255. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.