Method of Finding an Optimal Solution to the Problem of Interval Assignment

Models of transport and assignment play a major role in the Managing the logistics and supply chain to cut costs and Space, Service better. A general problem of assignment includes N tasks that must be delegated to N workers where each worker has the ability to perform all tasks. The goal is to assign a proper worker to each task so as to minimize total resource spending to complete all tasks. The purpose of this paper is to assess the question of an assignment under uncertainty (Interval form) and also transform the problem of assignment intervals into Hungarian method. At the end, a numerical example is given and to find an optimal solution for problem of distribution of intervals.