Application of Kuhn-Munkres Algorithm to Multi-Objective Assignment Problems

The assignment problem is a problem concerning the arrangement of a group of individuals in carrying out tasks with the aim of determining the right tasks so that the total use of resources can be minimized. Assignment problems that have several resources that must be optimized are called multi-objective assignment problems. The purpose of this study is to determine how to solve multi-objective assignment problems related to costs, completion time, and the number of defective products in the ABC confection business using the Kuhn-Munkres Algorithm with a graph theory approach. It is obtained that a daily wage savings of 3.47%, savings in the completion of the product 1.88%, and the reduced defect product produced by 33.33%.