Assignment problem (AP) is one of the main optimization problems, it is a private type of transportation problem (TP) in which every origin must have the ability to meet the request of any destination, i.e. any worker must be able to perform any job. The assignment problem is used to find one for one among a group of workers each of whom specializes for a specific job among a set of jobs, the main goal is to reduce gross cost (or reduce gross time) according to user requirements. This paper introduces two new methods (Al-Saeedi's 1st M. and Al-Saeedi's 2nd M.) to find a solution to the assignment problem. Moreover, some numerical examples were given to compare the results of the solution of the two new methods with the result of the solution of the Hungarian method. The two new methods are a systematic procedure, simple to apply and with minimal time and effort when using. The numerical experiment indicates that the two new methods are effective and promising.
Volume 12 | Issue 7
Pages: 49-54
DOI: 10.5373/JARDCS/V12I7/20201983