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

Simple item page
dc.contributor.authorHidayatullah, Muhammad Rasyid
dc.contributor.supervisorBahri, Zaiful
dc.date.accessioned2023-01-26T02:38:12Z
dc.date.available2023-01-26T02:38:12Z
dc.date.issued2022-10
dc.description.abstractPlacement 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.en_US
dc.description.sponsorshipFakultas Matematika dan Ilmu Pengetahuan Alamen_US
dc.identifier.citationPerpustakaanen_US
dc.identifier.otherElfitra
dc.identifier.urihttps://repository.unri.ac.id/handle/123456789/10828
dc.language.isoenen_US
dc.publisherElfitraen_US
dc.subjectAssignmenten_US
dc.subjectLinier Programmingen_US
dc.subjectHungarian Algorithmen_US
dc.subjectEfficiencyen_US
dc.titleOPTIMASI PENUGASAN KARYAWAN MENGGUNAKAN ALGORITMA HUNGARIAN (STUDI KASUS: HOLLYWOOD STUDIO)en_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Muhammad Rasyid Hidayatullah_compressed.pdf
Size:
291.47 KB
Format:
Unknown data format
Description:
artikel
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Sistem Infomasi