ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem

Zhu, Xuedong; Son, Junbo; Zhang, Xi; Wu, Jianguo*北京大学
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE2023-6DOI: 10.1016/j.omega.2022.102823
3被引1阅读
引用收藏
分享

摘要

The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving de-sirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, sev-eral approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS prob-lem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. & COPY; 2022 Elsevier Ltd.

学科与关键词

关键词
Integrated process planning and schedulingConstraint programmingLogic -based Benders decompositionForbidden intervals
相关
加载中…
  • Decomposition algorithms for the integrated process planning and scheduling problem
    Barzanji, Ramin; Naderi, Bahman*; Begen, Mehmet A.OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2020, 93: 102025.被引 43
  • Solving the integrated process planning and scheduling problem using an enhanced constraint programming-based approach
    Shi, Ganquan; Yang, Zhouwang*; Xu, Yang; Quan, YuchenInternational Journal of Production Research, 2022, 60(18): 5505-5522.被引 4
  • A graph-based constraint programming approach for the integrated process planning and scheduling problem
    Zhang, Luping*; Yu, Chunxia; Wong, T. N.COMPUTERS & OPERATIONS RESEARCH, 2021, 131: 105282.被引 10
查看全部 →

发表信息

论文状态
公开发表
期刊
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
发表日期
2023-06
卷期
第 117 卷
页码
102823
DOI
10.1016/j.omega.2022.102823
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [72,171,003, 71,932,006, 51,875,003]

作者

  • Z

    Zhu, Xuedong (第一作者)

    peking univ

  • S

    Son, Junbo

查看全部 4 位作者收起作者
  • Z

    Zhang, Xi

    peking univ

  • W

    Wu, Jianguo (通讯)

    peking univ

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417