• Dr. U.BALAKRISHNA

It is a two dimensional problem where the time matrix M(i, j) is the time of the jth job is assigned to ith person. The time matrix M(i. j)[i=1,2,3,…,m; j=1,2,3,…,n] is known. There are n jobs and out of the given n jobs only n1(<n) are to be assigned to m(<n1) persons, and each of the person is constrained to do the specified number of jobs. All the persons start working on the jobs simultaneously but a person cannot work on more than one job at a time. The problem is to assign the n1 jobs to m persons, with minimum total time with the restriction that the each person to do given specified number of jobs. A Lexi search approach is proposed using pattern recognition technique to find an optimal feasible assignment. For this problem a computer program is developed for the algorithm and is tested. It is observed that it takes less time for solving higher dimension problems also

Constraint assignment problem, Lexi search algorithm, Pattern recognition technique, Pattern, Alphabet

"A LEXI SEARCH APPROACH TO CONSTRAINT ASSIGNMENT PROBLEM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 11, page no.13-20, November-2018, Available :http://www.jetir.org/papers/JETIR1811503.pdf

"A LEXI SEARCH APPROACH TO CONSTRAINT ASSIGNMENT PROBLEM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 11, page no. pp13-20, November-2018, Available at : http://www.jetir.org/papers/JETIR1811503.pdf