Customer order scheduling on a serial-batch machine in precast bridge construction

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-10-16 DOI:10.1016/j.cor.2024.106871
Gang Liu , Yong Xie , Hongwei Wang
{"title":"Customer order scheduling on a serial-batch machine in precast bridge construction","authors":"Gang Liu ,&nbsp;Yong Xie ,&nbsp;Hongwei Wang","doi":"10.1016/j.cor.2024.106871","DOIUrl":null,"url":null,"abstract":"<div><div>Prefabricated construction is widely adopted in the current bridge construction project, especially offshore bridges. The realistic requirements of large quantities of prefabricated parts and tight delivery schedules make it extremely challenging to develop optimal scheduling. We address a new customer order scheduling on a serial-batch machine (COS-SBM) to reduce the sum of inventory holding costs of finished jobs and tardiness costs of orders in precast bridge construction. In the COS-SBM problem, all jobs with incompatibility in orders need to be divided into batches, which are then scheduled for processing on a serial-batch machine. We develop a mixed-integer linear programming model to formulate this new problem. Since the COS-SBM problem is NP-hard, we propose a genetic algorithm based on a novel batch sequencing and forming encoding method (GA-BSFE), which makes the scheduling and batching decisions simultaneously to enhance its exploration. Moreover, we design an efficient three-stage heuristic based on the order weighted modified due date rule and batch weighted longest processing time rule. The three-stage heuristic is introduced into the initiation of GA-BSFE to enhance its exploitation. Finally, a set of instances generated based on the realistic production of precast girders is tested to validate the effectiveness of GA-BSFE. The performance analysis suggests that GA-BSFE is the most appropriate for the COS-SBM problem.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106871"},"PeriodicalIF":4.1000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003435","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Prefabricated construction is widely adopted in the current bridge construction project, especially offshore bridges. The realistic requirements of large quantities of prefabricated parts and tight delivery schedules make it extremely challenging to develop optimal scheduling. We address a new customer order scheduling on a serial-batch machine (COS-SBM) to reduce the sum of inventory holding costs of finished jobs and tardiness costs of orders in precast bridge construction. In the COS-SBM problem, all jobs with incompatibility in orders need to be divided into batches, which are then scheduled for processing on a serial-batch machine. We develop a mixed-integer linear programming model to formulate this new problem. Since the COS-SBM problem is NP-hard, we propose a genetic algorithm based on a novel batch sequencing and forming encoding method (GA-BSFE), which makes the scheduling and batching decisions simultaneously to enhance its exploration. Moreover, we design an efficient three-stage heuristic based on the order weighted modified due date rule and batch weighted longest processing time rule. The three-stage heuristic is introduced into the initiation of GA-BSFE to enhance its exploitation. Finally, a set of instances generated based on the realistic production of precast girders is tested to validate the effectiveness of GA-BSFE. The performance analysis suggests that GA-BSFE is the most appropriate for the COS-SBM problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在桥梁预制构件制造的连续批量设备上进行客户订单调度
在当前的桥梁建设项目中,尤其是海上桥梁建设项目中,预制构件被广泛采用。大量预制构件的现实需求和紧迫的交货期使得制定最优排程极具挑战性。我们提出了一种新的串行批量设备(COS-SBM)上的客户订单调度方法,以降低桥梁预制施工中成品作业的库存持有成本和订单延迟成本之和。在 COS-SBM 问题中,所有订单不兼容的作业都需要分成若干批次,然后在串行批量设备上进行调度处理。我们开发了一个混合整数线性规划模型来解决这一新问题。由于 COS-SBM 问题具有 NP 难度,我们提出了一种基于新颖的批次排序和成形编码方法(GA-BSFE)的遗传算法,该算法可同时进行调度和批次决策,以增强其探索性。此外,我们还根据顺序加权修改到期日规则和批次加权最长处理时间规则设计了一种高效的三阶段启发式。三阶段启发式被引入到 GA-BSFE 的启动过程中,以提高其利用率。最后,测试了根据预制梁的实际生产情况生成的一组实例,以验证 GA-BSFE 的有效性。性能分析表明,GA-BSFE 最适合 COS-SBM 问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Editorial Board An accelerated Benders decomposition method for distributionally robust sustainable medical waste location and transportation problem Lexicographic optimization-based approaches to learning a representative model for multi-criteria sorting with non-monotonic criteria Portfolio optimisation: Bridging the gap between theory and practice A Q-learning driven multi-objective evolutionary algorithm for worker fatigue dual-resource-constrained distributed hybrid flow shop
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1