具有合格性约束和加工时间可控的分布式异构预制件生产调度问题的基于逻辑的Benders分解方法

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Fuli Xiong, An Ping, Muming Wu, Chengfei Xiang
{"title":"具有合格性约束和加工时间可控的分布式异构预制件生产调度问题的基于逻辑的Benders分解方法","authors":"Fuli Xiong,&nbsp;An Ping,&nbsp;Muming Wu,&nbsp;Chengfei Xiang","doi":"10.1016/j.eswa.2025.129234","DOIUrl":null,"url":null,"abstract":"<div><div>Precast production scheduling is a critical component in the industrialized construction sector. This study addresses the Distributed Heterogeneous Precast Production Scheduling Problem with Eligibility Constraints and Controllable Processing Times (DHPPSP_ECCPT). The problem involves allocating production orders across multiple factories, adjusting processing times, and sequencing operations with the dual objectives of minimizing the makespan and the cost associated with processing time adjustments. To tackle this complex problem, we first present two Mixed-Integer Nonlinear Programming (MINLP) models. These models are subsequently linearized into Mixed-Integer Linear Programming (MILP) formulations to enhance tractability. In addition, a Constraint Programming (CP) model is proposed as an alternative modeling approach. Due to the complexity of the problem, particularly for large-scale instances, we develop a novel Logic-Based Benders Decomposition (LBBD) framework based on Manne-based models and problem structure. This framework integrates MINLP and CP to address the Assignment and Adjustment Master Problem (AAMP), and the Scheduling Subproblems (SSPs). To improve computational efficiency, we incorporate strong SSP relaxation-based inequalities into the AAMP within the LBBD framework. Furthermore, valid Benders optimality cuts are generated by solving the SSPs, thereby further strengthening the AAMP. We also propose a variant of the LBBD framework, termed Branch-and-Check (BCH), to address the DHPPSP_ECCPT. Moreover, the integration of the proposed position-based MINLP model with the LBBD framework enhances the robustness of the overall solution approach. Comprehensive computational experiments are conducted to evaluate the performance of the proposed LBBD methods. The results demonstrate their effectiveness and efficiency in solving the DHPPSP_ECCPT, offering valuable insights for prefabricated production scheduling as well as other production scheduling applications.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"297 ","pages":"Article 129234"},"PeriodicalIF":7.5000,"publicationDate":"2025-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Logic-based Benders decomposition approaches for the distributed heterogeneous precast production scheduling problem with eligibility constraints and controllable processing times\",\"authors\":\"Fuli Xiong,&nbsp;An Ping,&nbsp;Muming Wu,&nbsp;Chengfei Xiang\",\"doi\":\"10.1016/j.eswa.2025.129234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Precast production scheduling is a critical component in the industrialized construction sector. This study addresses the Distributed Heterogeneous Precast Production Scheduling Problem with Eligibility Constraints and Controllable Processing Times (DHPPSP_ECCPT). The problem involves allocating production orders across multiple factories, adjusting processing times, and sequencing operations with the dual objectives of minimizing the makespan and the cost associated with processing time adjustments. To tackle this complex problem, we first present two Mixed-Integer Nonlinear Programming (MINLP) models. These models are subsequently linearized into Mixed-Integer Linear Programming (MILP) formulations to enhance tractability. In addition, a Constraint Programming (CP) model is proposed as an alternative modeling approach. Due to the complexity of the problem, particularly for large-scale instances, we develop a novel Logic-Based Benders Decomposition (LBBD) framework based on Manne-based models and problem structure. This framework integrates MINLP and CP to address the Assignment and Adjustment Master Problem (AAMP), and the Scheduling Subproblems (SSPs). To improve computational efficiency, we incorporate strong SSP relaxation-based inequalities into the AAMP within the LBBD framework. Furthermore, valid Benders optimality cuts are generated by solving the SSPs, thereby further strengthening the AAMP. We also propose a variant of the LBBD framework, termed Branch-and-Check (BCH), to address the DHPPSP_ECCPT. Moreover, the integration of the proposed position-based MINLP model with the LBBD framework enhances the robustness of the overall solution approach. Comprehensive computational experiments are conducted to evaluate the performance of the proposed LBBD methods. The results demonstrate their effectiveness and efficiency in solving the DHPPSP_ECCPT, offering valuable insights for prefabricated production scheduling as well as other production scheduling applications.</div></div>\",\"PeriodicalId\":50461,\"journal\":{\"name\":\"Expert Systems with Applications\",\"volume\":\"297 \",\"pages\":\"Article 129234\"},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2025-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Expert Systems with Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0957417425028507\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0957417425028507","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

预制件生产调度是工业化建筑部门的一个关键组成部分。研究了具有合格约束和加工时间可控的分布式异构预制生产调度问题(DHPPSP_ECCPT)。该问题涉及到跨多个工厂分配生产订单、调整处理时间和排序操作,其双重目标是最小化完工时间和与处理时间调整相关的成本。为了解决这个复杂的问题,我们首先提出了两个混合整数非线性规划(MINLP)模型。这些模型随后线性化为混合整数线性规划(MILP)公式,以提高可追溯性。此外,还提出了一种约束规划(CP)模型作为备选的建模方法。由于问题的复杂性,特别是对于大规模实例,我们开发了一种基于基于人的模型和问题结构的基于逻辑的弯曲分解(LBBD)框架。该框架集成了MINLP和CP来解决分配与调整主问题(AAMP)和调度子问题(ssp)。为了提高计算效率,我们在LBBD框架内的AAMP中加入了强SSP松弛不等式。此外,通过求解ssp生成有效的Benders最优切割,从而进一步增强了AAMP。我们还提出了LBBD框架的一个变体,称为分支和检查(BCH),以解决DHPPSP_ECCPT。此外,所提出的基于位置的MINLP模型与LBBD框架的集成增强了整体求解方法的鲁棒性。通过全面的计算实验来评估所提出的LBBD方法的性能。结果证明了该方法在解决DHPPSP_ECCPT问题上的有效性和效率,为装配式生产调度以及其他生产调度应用提供了有价值的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Logic-based Benders decomposition approaches for the distributed heterogeneous precast production scheduling problem with eligibility constraints and controllable processing times
Precast production scheduling is a critical component in the industrialized construction sector. This study addresses the Distributed Heterogeneous Precast Production Scheduling Problem with Eligibility Constraints and Controllable Processing Times (DHPPSP_ECCPT). The problem involves allocating production orders across multiple factories, adjusting processing times, and sequencing operations with the dual objectives of minimizing the makespan and the cost associated with processing time adjustments. To tackle this complex problem, we first present two Mixed-Integer Nonlinear Programming (MINLP) models. These models are subsequently linearized into Mixed-Integer Linear Programming (MILP) formulations to enhance tractability. In addition, a Constraint Programming (CP) model is proposed as an alternative modeling approach. Due to the complexity of the problem, particularly for large-scale instances, we develop a novel Logic-Based Benders Decomposition (LBBD) framework based on Manne-based models and problem structure. This framework integrates MINLP and CP to address the Assignment and Adjustment Master Problem (AAMP), and the Scheduling Subproblems (SSPs). To improve computational efficiency, we incorporate strong SSP relaxation-based inequalities into the AAMP within the LBBD framework. Furthermore, valid Benders optimality cuts are generated by solving the SSPs, thereby further strengthening the AAMP. We also propose a variant of the LBBD framework, termed Branch-and-Check (BCH), to address the DHPPSP_ECCPT. Moreover, the integration of the proposed position-based MINLP model with the LBBD framework enhances the robustness of the overall solution approach. Comprehensive computational experiments are conducted to evaluate the performance of the proposed LBBD methods. The results demonstrate their effectiveness and efficiency in solving the DHPPSP_ECCPT, offering valuable insights for prefabricated production scheduling as well as other production scheduling applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Expert Systems with Applications
Expert Systems with Applications 工程技术-工程:电子与电气
CiteScore
13.80
自引率
10.60%
发文量
2045
审稿时长
8.7 months
期刊介绍: Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信