IPB University Logo

SCIENTIFIC REPOSITORY

IPB University Scientific Repository collects, disseminates, and provides persistent and reliable access to the research and scholarship of faculty, staff, and students at IPB University

AI Repository
 
Building and Categories


      View Item 
      •   IPB Repository
      • Final Assignments
      • Undergraduate Final Assignments
      • UF - Faculty of Mathematics and Natural Sciences
      • UF - Mathematics
      • View Item
      •   IPB Repository
      • Final Assignments
      • Undergraduate Final Assignments
      • UF - Faculty of Mathematics and Natural Sciences
      • UF - Mathematics
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Penerapan Algoritme Hungaria Berdasarkan Teorema König dan Egerváry dalam Masalah Penugasan

      Thumbnail
      View/Open
      Cover (938.4Kb)
      Fullteks (1.049Mb)
      Date
      2021
      Jenis/Type
      Undergraduate Thesis
      Author
      Andini, Nabilah Septi
      Aman, Amril
      Hanum, Farida
      Metadata
      Show full item record
      Abstract
      Masalah penugasan dapat dimodelkan dalam suatu bentuk integer programming. Masalah penugasan timbul akibat masing-masing sumber daya memiliki tingkatan efisiensi yang berbeda dalam menjalankan tugas yang berbeda. Karena itu pengalokasian sumber daya untuk mengerjakan tugas secara efisien merupakan keputusan yang penting. Secara umum, masalah penugasan dapat dituliskan sebagai pengalokasian sejumlah sumber daya ke sejumlah tugas agar mengoptimumkan suatu fungsi objektif tertentu. Salah satu metode yang dapat digunakan dalam masalah penugasan adalah metode Hungaria. Metode Hungaria merupakan algoritme yang diperkenalkan oleh Harold W. Kuhn, algoritme ini dikembangkan berdasarkan hasil kerja Denes König dan Jeno Egerváry. Tujuan dari penulisan karya ilmiah ini adalah mengkaji secara teoretis Teorema König dan Egerváry dan menerapkan algoritme Hungaria pada suatu kasus masalah penugasan. Teorema akan dikaji dengan pembuktian beberapa teorema teori graf terkait dan dengan teorema dualitas. Dalam karya ilmiah ini diterapkan algoritme Hungaria dengan kompleksitas O(n^4).
       
      The assignment problem can be modeled as an integer programming. Assignment problems arise because each resource has different level of efficiency to perform different tasks. Therefore, allocating resources to perform tasks efficiently is an important decision. In general, assignment problem can be described as allocating a number of resources to a number of tasks in order to optimize a certain objective function. One method that can be used to solve assignment problems is the Hungarian method. Hungarian method is an algorithm introduced by Harold W. Kuhn, this algorithm was developed based on the work of Denes König and Jeno Egerváry. The purpose of writing this paper is to theoretically examine the König and Egerváry Theorem and apply the Hungarian algorithm to one case of the assignment problems. The theorem will be examined by proving several related graph theory theorems and the duality theorems. In this paper, the Hungarian algorithm with O(n^4) complexity is applied.
       
      URI
      http://repository.ipb.ac.id/handle/123456789/108950
      Collections
      • UF - Mathematics [1487]

      Copyright © 2020 Library of IPB University
      All rights reserved
      Contact Us | Send Feedback
      Indonesia DSpace Group 
      IPB University Scientific Repository
      UIN Syarif Hidayatullah Institutional Repository
      Universitas Jember Digital Repository
        

       

      Browse

      All of IPB RepositoryCollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

      My Account

      Login

      Application

      google store

      Copyright © 2020 Library of IPB University
      All rights reserved
      Contact Us | Send Feedback
      Indonesia DSpace Group 
      IPB University Scientific Repository
      UIN Syarif Hidayatullah Institutional Repository
      Universitas Jember Digital Repository