Max-Min Probabilistic Algorithms for Parallel Machines

M. Jemmali, M. Otoom, Fayez al Fayez
{"title":"Max-Min Probabilistic Algorithms for Parallel Machines","authors":"M. Jemmali, M. Otoom, Fayez al Fayez","doi":"10.1145/3394941.3394945","DOIUrl":null,"url":null,"abstract":"This paper treats the maximization of the minimum completion time regarding the identical parallel machines problem. This problem is well known as follows. Our work concerns with industry field, when we have several identical and parallel machines and we have faced to many different jobs. The problem is how to find an appropriate solution that gives us a method to schedule the different jobs on the given machines. The objective function is the maximization of machine completion time which has the minimum time comparing with all other machines. This problem is shown as NP-hard. We propose some algorithms that give approximate solutions to the studied problem. Several instances were tested in this paper to show the performance of the proposed approximate solutions.","PeriodicalId":143754,"journal":{"name":"Proceedings of the 2020 International Conference on Industrial Engineering and Industrial Management","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 International Conference on Industrial Engineering and Industrial Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3394941.3394945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

This paper treats the maximization of the minimum completion time regarding the identical parallel machines problem. This problem is well known as follows. Our work concerns with industry field, when we have several identical and parallel machines and we have faced to many different jobs. The problem is how to find an appropriate solution that gives us a method to schedule the different jobs on the given machines. The objective function is the maximization of machine completion time which has the minimum time comparing with all other machines. This problem is shown as NP-hard. We propose some algorithms that give approximate solutions to the studied problem. Several instances were tested in this paper to show the performance of the proposed approximate solutions.
并行机器的最大-最小概率算法
本文研究了同一并联机床的最小完工时间最大化问题。这个问题是众所周知的。我们的工作涉及工业领域,当我们有几台相同和平行的机器时,我们面临着许多不同的工作。问题是如何找到一个合适的解决方案,给我们一种在给定机器上调度不同作业的方法。目标函数是机器完成时间的最大化,与所有其他机器相比,完成时间最少。这个问题用NP-hard表示。我们提出了一些算法来给出所研究问题的近似解。本文通过几个实例验证了所提近似解的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信