两台并联机床上模具约束的近似最优解

IF 1.2 4区计算机科学 Q4 AUTOMATION & CONTROL SYSTEMS

Studies in Informatics and Control Pub Date : 2022-03-30 DOI:10.24846/v31i1y202207

Abir Ben Hmida, M. Jemmali

{"title":"两台并联机床上模具约束的近似最优解","authors":"Abir Ben Hmida, M. Jemmali","doi":"10.24846/v31i1y202207","DOIUrl":null,"url":null,"abstract":": This paper investigates the mold constraints for the two parallel machines problem. The goal is to minimize the makespan. The resource constraint can be defined as a mold. This constraint is also defined as jobs with conflict. Two jobs can’t be executed by the two machines simultaneously. The problem is proved to be a non-deterministic polynomial NP-hard one. Different heuristics have been proposed in this paper to solve the studied problem. A novel meta-heuristics algorithm is developed to enhance the proposed heuristics. The computational results and discussions show the performance of the proposed solutions. A different class of instances is implemented to test the proposed heuristics. The results show that the developed heuristics reaches the optimal solution in 96.4% of instances. Therefore, the obtained results represent near- optimal solutions for the studied problem.","PeriodicalId":49466,"journal":{"name":"Studies in Informatics and Control","volume":" ","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Near-Optimal Solutions for Mold Constraints on Two Parallel Machines\",\"authors\":\"Abir Ben Hmida, M. Jemmali\",\"doi\":\"10.24846/v31i1y202207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": This paper investigates the mold constraints for the two parallel machines problem. The goal is to minimize the makespan. The resource constraint can be defined as a mold. This constraint is also defined as jobs with conflict. Two jobs can’t be executed by the two machines simultaneously. The problem is proved to be a non-deterministic polynomial NP-hard one. Different heuristics have been proposed in this paper to solve the studied problem. A novel meta-heuristics algorithm is developed to enhance the proposed heuristics. The computational results and discussions show the performance of the proposed solutions. A different class of instances is implemented to test the proposed heuristics. The results show that the developed heuristics reaches the optimal solution in 96.4% of instances. Therefore, the obtained results represent near- optimal solutions for the studied problem.\",\"PeriodicalId\":49466,\"journal\":{\"name\":\"Studies in Informatics and Control\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2022-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Studies in Informatics and Control\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.24846/v31i1y202207\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studies in Informatics and Control","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.24846/v31i1y202207","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 7

摘要

：本文研究了两个平行机器问题的模具约束。目标是最大限度地缩短完工时间。资源约束可以定义为模具。此约束也被定义为具有冲突的作业。两台机器不能同时执行两个作业。证明了该问题是一个非确定性多项式NP难问题。本文提出了不同的启发式方法来解决所研究的问题。开发了一种新的元启发式算法来增强所提出的启发式算法。计算结果和讨论表明了所提出的解决方案的性能。实现了一类不同的实例来测试所提出的启发式算法。结果表明，所开发的启发式算法在96.4%的实例中达到了最优解。因此，所得到的结果代表了所研究问题的近似最优解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Near-Optimal Solutions for Mold Constraints on Two Parallel Machines

: This paper investigates the mold constraints for the two parallel machines problem. The goal is to minimize the makespan. The resource constraint can be defined as a mold. This constraint is also defined as jobs with conflict. Two jobs can’t be executed by the two machines simultaneously. The problem is proved to be a non-deterministic polynomial NP-hard one. Different heuristics have been proposed in this paper to solve the studied problem. A novel meta-heuristics algorithm is developed to enhance the proposed heuristics. The computational results and discussions show the performance of the proposed solutions. A different class of instances is implemented to test the proposed heuristics. The results show that the developed heuristics reaches the optimal solution in 96.4% of instances. Therefore, the obtained results represent near- optimal solutions for the studied problem.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Studies in Informatics and Control AUTOMATION & CONTROL SYSTEMS-OPERATIONS RESEARCH & MANAGEMENT SCIENCE

CiteScore

2.70

自引率

25.00%

发文量

审稿时长

>12 weeks

期刊介绍： Studies in Informatics and Control journal provides important perspectives on topics relevant to Information Technology, with an emphasis on useful applications in the most important areas of IT. This journal is aimed at advanced practitioners and researchers in the field of IT and welcomes original contributions from scholars and professionals worldwide. SIC is published both in print and online by the National Institute for R&D in Informatics, ICI Bucharest. Abstracts, full text and graphics of all articles in the online version of SIC are identical to the print version of the Journal.