• S. LEEMA MARY
• V. MAHADEVAN

The time minimizing assignment problem dealing with the allocation of n jobs to n persons is considered in this paper. One job is to be allotted to One person and each person does at least one job. All the persons start working on the jobs simultaneously. The aim of the present study is to find that feasible assignment which minimizes the total time for completing all the jobs. In this paper, we proposed a new algorithm to find the optimal feasible assignment. The proposed algorithm is very easy to understand and apply.

Assignment problem, Proposed algorithm, Optimal feasible assignment, Time minimizing, Assignment Table.

"A NEW ALGORITHM TO FIND THE OPTIMAL FEASIBLE ASSIGNMENT FOR AN ASSIGNMENT PROBLEM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 6, page no.649-652, June-2018, Available :http://www.jetir.org/papers/JETIR1806337.pdf

"A NEW ALGORITHM TO FIND THE OPTIMAL FEASIBLE ASSIGNMENT FOR AN ASSIGNMENT PROBLEM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 6, page no. pp649-652, June-2018, Available at : http://www.jetir.org/papers/JETIR1806337.pdf