HUNGARIAN ALGORITHM USING STORED PROCEDURE
Daftar Isi:
- There are workers, jobs, and the costs data. They are mapped into table. One worker will do one job with the costs that have been noted. From the costs that have been noted, they are not optimal costs. So it needs to find the minim costs as the optimal costs. To find the minim costs with many workers and jobs data by manual computing is difficult. So it is offered Hungarian Algorithm to solve it. Hungarian Algorithm works by mapping the workers, jobs, and costs data into table. The row and column in the table will be normalized and eliminated. The processes are looped iteratively until find the most minim costs. The result from normalizing and eliminating row and column in table will be found the optimal costs from workers and jobs data. Keyword: hungarian algorithm, stored procedure, assignment problem