i-manager Publications

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.

Periodicity:January - March'2018
DOI : 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.

Keywords

Assignment Problem, Lexi Search Algorithm, Pattern Recognition Technique, Pattern, Alphabet.

How to Cite this Article?

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

References

[1]. Balakrishna, U. (2009). Operations Research (Doctoral Dissertation, Sri Venkateswara University.)

[2]. Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2011). Linear Programming and Network Flows. John Wiley & Sons.

[3]. Bhavani, V., & Murthy, S. M. (2005). Time-Dependent Traveling Salesman Problem, OPSEARCH, 42(3), 199-227.

[4]. Geetha, S. & Nair, K. P. (1993). A Variation of the Assignment Problem. European Journal of Operations Research, 68(3), 422-426.

[5]. Goel, B. S., Mittal, S. K. (1982). Operations Research, Fifty Ed., 2405-2416. Pragati Prakahan.

[6]. Murthy, S. M. (1979). Combinational Programming. A Pattern Recognition Approach (Doctoral Dissertation, RFC, Warangal).

[7]. Pandit, S. N. N. & Rajbhugshi. (1976). Restricted Travelling Salesman Problem through n sets of nodes.

[8]. Pandit, S. N. N., & Srinivas, K. (1962). A Lexisearch algorithm for traveling Salesman problem. [Proceedings] 1991 IEEE International Joint Conference on Neural Networks (Vol. 3, pp. 2521-2527).

[9]. Singh, S., Dubey, G. C., & Shrivastava, R. (2012). A comparative analysis of assignment problem. IOSR Journal of Engineering (IOSRJEN), 2(8), 1-15.

[10]. Taha, H. A. (2006). Operations Research: An Introduction, 8 Edition. Prentice Hall.

[11]. Zimmermann, H. J., & Tapador, R. (1996). Solving the Assignment, Third Ed. Kluwer Academic, Boston.

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25

A New Approach to Variant Assignment Problem

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: