An Alternative Row Adaptation technique for Solving Assignment Problems

Author(s)	Dr. Sushanta Kumer Roy, Zolakha Akter, Prof. Dr. Mohammad Nazrul Islam
Country	Bangladesh
Abstract	Assignment problems are a fundamental optimization challenge in operations management, where tasks, resources, or personnel must be assigned efficiently to minimize costs or maximize effectiveness. These problems often arise in various industries, including logistics, manufacturing, and workforce scheduling. The classical assignment problem is modeled as a linear programming problem, typically solved using the Hungarian algorithm, which guarantees an optimal assignment with polynomial-time complexity. This paper explores an alternative time-consuming technique to solve balanced and unbalanced assignment problems which is very effective and straight forward. The traditional technique subtracts the row or column minimum entries from all the entries of assignment matrix whereas technique proposed in this paper subtracts only rows minimum entry from each row of the cost matrix, and for adaptation added unit amount in each row. Finally, the numerical illustrations and comparisons of different real-world problems shows the effectiveness of the proposed technique.
Keywords	Assignment problem, Row Adaptation, Balanced and unbalanced problems, Cost matrix, Optimization.
Field	Mathematics
Published In	Volume 7, Issue 3, May-June 2025
Published On	2025-05-30
DOI	https://doi.org/10.36948/ijfmr.2025.v07i03.46527
Short DOI	https://doi.org/g9mtsm

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research