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

IF 3.1 4区 管理学 Q2 MANAGEMENT
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":"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}
引用次数: 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.
将资源受限项目调度问题的改编约束编程公式应用于相同并联机器分组车间和混合车间调度问题
在本文中,我们研究了分组车间和混合车间调度问题,每个工作站都有单机和相同的并行机器,并采用了 "makespan "标准。我们采用了之前针对经典的资源受限项目调度问题提出的约束编程公式。我们的方法在 130 个经典分组车间调度问题实例中的 107 个实例和 320 个经典混合车间调度问题实例中都达到了最优,其有效性显而易见。在最后一组实例中,我们获得了 13 个新的最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Transactions in Operational Research
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.
×
引用
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学术官方微信