A modified method for solving the unbalanced assignment problems

It has been noticed that in real life situations, one finds it difficult to balance between jobs and machines, therefore most of the time we face unbalanced assignment problems. The methods suggested in the literature is based on the assumption to assign some of the jobs to dummy or fictitious machines, those jobs are executed on dummy machines which later may be ignored. The present paper suggests a modified method for solving the unbalanced assignment problems. The method is capable of assigning all the jobs to machine optimally. The method is presented in an algorithmic form and implemented on the several sets of input data to test the performance and effectiveness of the algorithm. The developed algorithm is coded into C++. A comparison is also made with the existing approach and it is recorded that our algorithm gives better results.