应用匈牙利方法和新的替代方法优化任务分配

Novita Triani Hamma, NI Ketut Tari Tastrawati, Kartika Sari
{"title":"应用匈牙利方法和新的替代方法优化任务分配","authors":"Novita Triani Hamma, NI Ketut Tari Tastrawati, Kartika Sari","doi":"10.24843/mtk.2024.v13.i01.p435","DOIUrl":null,"url":null,"abstract":"One of the materials discussed in operations research is linear programming, which also discusses models of transportation. The assignment problem can be viewed as a special case of the transportation model. One method that is often used to solve assignment problems is the Hungarian method. Over time, there have also been more and more alternative methods to streamline processing time in solving assignment problems, one of which is the new alternate method.   The purpose of this  research is to form an optimal scheduling with minimum processing time.  The data used in this study is secondary data obtained from CV Bagus Classic. The data consists of the number of workers, type of work, and the time needed to complete the work by each worker. As a result of this research, it was found that the minimum assignment time was achieved when using the Hungarian method compared to using the new alternate method or before using both methods.","PeriodicalId":11600,"journal":{"name":"E-Jurnal Matematika","volume":"77 ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"OPTIMASI PENUGASAN MELALUI PENERAPAN HUNGARIAN METHOD DAN NEW ALTERNATE METHOD\",\"authors\":\"Novita Triani Hamma, NI Ketut Tari Tastrawati, Kartika Sari\",\"doi\":\"10.24843/mtk.2024.v13.i01.p435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the materials discussed in operations research is linear programming, which also discusses models of transportation. The assignment problem can be viewed as a special case of the transportation model. One method that is often used to solve assignment problems is the Hungarian method. Over time, there have also been more and more alternative methods to streamline processing time in solving assignment problems, one of which is the new alternate method.   The purpose of this  research is to form an optimal scheduling with minimum processing time.  The data used in this study is secondary data obtained from CV Bagus Classic. The data consists of the number of workers, type of work, and the time needed to complete the work by each worker. As a result of this research, it was found that the minimum assignment time was achieved when using the Hungarian method compared to using the new alternate method or before using both methods.\",\"PeriodicalId\":11600,\"journal\":{\"name\":\"E-Jurnal Matematika\",\"volume\":\"77 \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"E-Jurnal Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24843/mtk.2024.v13.i01.p435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"E-Jurnal Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24843/mtk.2024.v13.i01.p435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

线性规划是运筹学讨论的材料之一,它也讨论运输模型。分配问题可以看作是运输模型的一个特例。解决分配问题常用的一种方法是匈牙利法。随着时间的推移,也有越来越多的替代方法来简化解决分配问题的处理时间,新的替代方法就是其中之一。 本研究的目的是形成一个处理时间最短的最优排程。 本研究使用的数据是从 CV Bagus Classic 获得的二手数据。这些数据包括工人数量、工作类型以及每个工人完成工作所需的时间。研究结果表明,使用匈牙利方法与使用新的替代方法或在使用这两种方法之前相比,分配时间最短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
OPTIMASI PENUGASAN MELALUI PENERAPAN HUNGARIAN METHOD DAN NEW ALTERNATE METHOD
One of the materials discussed in operations research is linear programming, which also discusses models of transportation. The assignment problem can be viewed as a special case of the transportation model. One method that is often used to solve assignment problems is the Hungarian method. Over time, there have also been more and more alternative methods to streamline processing time in solving assignment problems, one of which is the new alternate method.   The purpose of this  research is to form an optimal scheduling with minimum processing time.  The data used in this study is secondary data obtained from CV Bagus Classic. The data consists of the number of workers, type of work, and the time needed to complete the work by each worker. As a result of this research, it was found that the minimum assignment time was achieved when using the Hungarian method compared to using the new alternate method or before using both methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
34
审稿时长
24 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信