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
Francisco Yuraszeck, Gonzalo Mejía, Armin Lüer-Villagra
{"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":"<p>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.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 3","pages":"1422-1441"},"PeriodicalIF":2.9000,"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://onlinelibrary.wiley.com/doi/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
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.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
