An efficient methodology for robust assignment problem
by Kais Zaman; Subrata Kumar Saha
International Journal of Operational Research (IJOR), Vol. 33, No. 2, 2018

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.

Online publication date: Tue, 02-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com