Open AccessMethod of finding an optimal solution for interval balanced and unbalanced assignment problem
Author(s) -
G. Ramesh,
G. Sudha,
K. Ganesan
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/912/6/062031
Subject(s) - assignment problem , interval (graph theory) , generalized assignment problem , weapon target assignment problem , hungarian algorithm , mathematical optimization , scheme (mathematics) , sequence (biology) , position (finance) , computer science , subject (documents) , mathematics , operations research , economics , combinatorics , biology , library science , mathematical analysis , genetics , finance
All Assignment problems are a famous subject as well as is second-hand extremely frequently in solving problems of industrial and administration science. Transportation and assignment models playing significant position in logistics and deliver sequence administration for dropping fee and time, for improved facility. The assignment problem is one of the major problems while assigning job to the employee. It is a significant problem in mathematics and is also discuss in actual physical world. In this paper, we planned a original move towards for solving a balanced and unbalanced assignment problem. The grades of original approach are compared through existing approaches. Such parameters are a bunch of devices and these vague parameters are expressed by intervals. Through this involvement we suggest Hungarian method of interval and consider the thinking of interval analysis to solve linear assignment problems. The question of assignment without converting them to traditional assignment issue. In this paper a numerical scheme is investigated in detail.