An efficient methodology for robust assignment problem

Kais Zaman and Subrata Kumar Saha

International Journal of Operational Research, 2018, vol. 33, issue 2, 239-255

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.

Keywords: assignment problem; uncertainty; multi-objective optimisation; robust optimisation. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=95199 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:33:y:2018:i:2:p:239-255

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().