Article: Comparative study of maximisation assignment model by existing method and newly proposed methods Journal: International Journal of Operational Research (IJOR) 2024 Vol.51 No.4 pp.469 - 490 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 <i>n</i>-items to <i>m</i>-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. Inderscience Publishers - linking academia, business and industry through research

Title: Comparative study of maximisation assignment model by existing method and newly proposed methods

Authors: Agnivesh Tiwari; Kabir Chaudhary; Rahul Boadh; Yogendra Kumar Rajoria

Addresses: Department of Mathematics, School of Basic and Applied Science, KR Mangalam University, Sohna Road, Gurugram, Haryana 122103, India ' Department of Mathematics, School of Basic and Applied Science, KR Mangalam University, Sohna Road, Gurugram, Haryana 122103, India ' Department of Mathematics, School of Basic and Applied Science, KR Mangalam University, Sohna Road, Gurugram, Haryana 122103, India ' Department of Mathematics, School of Basic and Applied Science, KR Mangalam University, Sohna Road, Gurugram, Haryana 122103, India

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.

Keywords: assignment problem; Hungarian method; optimal solution; profit maximisation.

DOI: 10.1504/IJOR.2024.143341

International Journal of Operational Research, 2024 Vol.51 No.4, pp.469 - 490

Received: 05 Aug 2021
Accepted: 13 Feb 2022
Published online: 16 Dec 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Comparative study of maximisation assignment model by existing method and newly proposed methods

Keep up-to-date