Comparative study of maximisation assignment model by existing method and newly proposed methods Online publication date: Mon, 16-Dec-2024
by Agnivesh Tiwari; Kabir Chaudhary; Rahul Boadh; Yogendra Kumar Rajoria
International Journal of Operational Research (IJOR), Vol. 51, No. 4, 2024
Abstract: One of the simplest uses of linear programming is known as the assignment problem, which is a special case of the transportation problem. The assignment problem manages the inquiry about to dole out n-items to m-different items in the most ideal way for production planning, telecommunication, VLSI design, economics, etc. Many researchers developed newly proposed methods for solving assignment problems and others modified the Hungarian method. Therefore, in the present study, an effort has been made to solve the real-life balance and unbalance type profit maximisation assignment problem used by ten newly proposed methods such as MAP, MSEI, ATOC, NAZs and six others methods, and compared results with Hungarian method. This study found that Method 8 takes the least time for computation of both type problems as compared with other methods. This paper advocates that new researchers and scientists may use the newly proposed Method 8 in place of the existing method.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook