将资源受限项目调度问题的改编约束编程公式应用于相同并联机器分组车间和混合车间调度问题

IF 3.1 4区管理学 Q2 MANAGEMENT

International Transactions in Operational Research Pub Date : 2024-07-08 DOI:10.1111/itor.13504

Francisco Yuraszeck, Gonzalo Mejía, Armin Lüer‐Villagra

{"title":"将资源受限项目调度问题的改编约束编程公式应用于相同并联机器分组车间和混合车间调度问题","authors":"Francisco Yuraszeck, Gonzalo Mejía, Armin Lüer‐Villagra","doi":"10.1111/itor.13504","DOIUrl":null,"url":null,"abstract":"In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource‐constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"15 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An adapted constraint‐programming formulation of the resource‐constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems\",\"authors\":\"Francisco Yuraszeck, Gonzalo Mejía, Armin Lüer‐Villagra\",\"doi\":\"10.1111/itor.13504\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource‐constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions.\",\"PeriodicalId\":49176,\"journal\":{\"name\":\"International Transactions in Operational Research\",\"volume\":\"15 1\",\"pages\":\"\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Transactions in Operational Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1111/itor.13504\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Transactions in Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1111/itor.13504","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们研究了分组车间和混合车间调度问题，每个工作站都有单机和相同的并行机器，并采用了 "makespan "标准。我们采用了之前针对经典的资源受限项目调度问题提出的约束编程公式。我们的方法在 130 个经典分组车间调度问题实例中的 107 个实例和 320 个经典混合车间调度问题实例中都达到了最优，其有效性显而易见。在最后一组实例中，我们获得了 13 个新的最优解。

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

查看原文本刊更多论文

An adapted constraint‐programming formulation of the resource‐constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems

In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource‐constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions.

求助全文

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

来源期刊

International Transactions in Operational Research OPERATIONS RESEARCH & MANAGEMENT SCIENCE-

CiteScore

7.80

自引率

12.90%

发文量

146

审稿时长

>12 weeks

期刊介绍： International Transactions in Operational Research (ITOR) aims to advance the understanding and practice of Operational Research (OR) and Management Science internationally. Its scope includes: International problems, such as those of fisheries management, environmental issues, and global competitiveness International work done by major OR figures Studies of worldwide interest from nations with emerging OR communities National or regional OR work which has the potential for application in other nations Technical developments of international interest Specific organizational examples that can be applied in other countries National and international presentations of transnational interest Broadly relevant professional issues, such as those of ethics and practice Applications relevant to global industries, such as operations management, manufacturing, and logistics.