A New Approach to Variant Assignment Problem

Volume 7 Issue 1 January - March 2018

Research Paper

A New Approach to Variant Assignment Problem

Uruturu balakrishna*

Professor of Mathematics, Department of Science & Humanities, Sreenivasa Institute of Technology and Management Studies, Chittoor, India.

Balakrishna, U. (2018). A New Approach to Variant Assignment Problem. i-manager’s Journal on Mathematics, 7(1), 34-42.https://doi.org/10.26634/jmat.7.1.14030

Abstract

It is a two dimensional problem where the time matrix T(i, j) is the time of the j job assigned to i person. The time matrix T(i.j) [i=1,2,3,…, m; j=1,2,3,…,n] is known. 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 n jobs to m persons, with minimum total time with the restriction that 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.