OPTIMASI PENUGASAN KARYAWAN MENGGUNAKAN ALGORITMA HUNGARIAN (STUDI KASUS: HOLLYWOOD STUDIO)

Abstract

Placement of employee duties in each type of work is one of the problems that often occurs in a company. The assignment problem is one of the linear programming. Common assignment problems include n tasks that must be assigned to m employees, where each employee has different competencies in completing a task. Hollywood Studio is a business that is engaged in photography services and there are problems regarding the processing time which feels long and inefficient. One of the methods used to solve this assignment problem is to use the Hungarian algorithm. The aims of this study are to optimize employee assignments in terms of minimum work completion time to see the occurrence of work time efficiency before and after using the Hungarian algorithm and to make a web-based job assignment optimization calculation program using the Hungarian algorithm. Data used in this study was collected by taken directly to the field, in the form of data on the completion time of each type of work carried out by each employee from July 4 to August 6, 2022, totaling 133 data. The result of the calculation before using the Hungarian algorithm is 50.4 minutes and the calculation after using the Hungarian algorithm is 42 minutes, resulting in an efficiency of 8.4 minutes of work completion and system design using Unified Modeling Language (UML) which consists of use cases, classes diagrams, activity diagrams, and sequence diagrams.