Modified Hungarian method for unbalanced assignment problem with multiple jobs

Quazzafi Rabbani, Aamir Khan and Abdul Quddoos

Applied Mathematics and Computation, 2019, vol. 361, issue C, 493-498

Abstract: The existing Hungarian method for solving unbalanced assignment problems is based on the assumptions to assign some jobs to dummy or pseudo machines, those jobs assigned to dummy machines are actually left without execution. In real world situations one may be interested to execute all the jobs on actual machines. This purpose can be served by assigning multiple jobs to a single machine. The present paper proposes a Modified Hungarian Method for solving unbalanced assignment problems which gives the optimal policy of assignment of jobs to machines. A stepwise algorithm of proposed method is presented and the developed algorithm is also coded in Java SE 11. A numerical example is taken to demonstrate the performance and efficiency of the proposed method. The obtained result is then compared with several existing methods to show the superiority of our algorithm.

Keywords: Unbalanced assignment problem; Hungarian Method; Modified Hungarian Method (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319304436
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:361:y:2019:i:c:p:493-498

DOI: 10.1016/j.amc.2019.05.041

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().