Abstract
In this paper, we have proposed a noveland innovative method entitled E-SOFT fordetermining the optimal assignment plans to the unbalanced assignment problems (UAPs) and viewed its performance with the existing Hungarian method and the Mantra technique. The ESOFT algorithm has beeninheritedfrom the existing SOFTMIN algorithm developed for solving transportation problems and also extended for solving the UAPs.The Extended SOFTMIN method is in short termed as E-SOFT method. The performance of the proposed E-SOFT method over the Hungarian and Mantra methods has been tested on a set of 20 identified UAPs. Experimental results validate that the E-SOFT is an alternative simple method to solve UAPs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
