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

Decomposition algorithms for the integrated process planning and scheduling problem

Barzanji, Ramin; Naderi, Bahman*; Begen, Mehmet A.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE2020-6DOI: 10.1016/j.omega.2019.01.003
43被引1阅读
引用收藏
分享

摘要

There are several algorithms to solve the integrated process planning and scheduling (IPPS) problem (i.e., flexible job shop scheduling with process plan flexibility) in the literature. All the existing algorithms for IPPS are heuristic-based search methods and no research has investigated the use of exact solution methods for this problem. We develop several decomposition approaches based on the logic-based Benders decomposition (LBBD) algorithm. Our LBBD algorithm allows us to partition the decision variables in the IPPS problem into two models, master-problem and sub-problem. The master-problem determines process plan and operation-machine assignment, while the sub-problem optimizes sequencing and scheduling decisions. To achieve faster convergence, we develop two relaxations for the optimal makespan objective function and incorporate them into the master-problem. We analyze the performance and further enhance the algorithm with two ideas, a Benders optimality cut based on the critical path and a faster heuristic way to solve the sub-problem. 16 standard benchmark instances available in the literature are solved to evaluate and compare the performances of our algorithms with those of the state-of-the-art methods in the literature. The proposed algorithm either results in the optimal solution or improves the best-known solutions in all the existing instances, demonstrating its superiority to the existing state-of-the-art methods in literature.

学科与关键词

关键词
Integrated process planning and scheduling problemBenders decompositionOptimality cutCritical path
相关
加载中…
  • 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 SCIENCE, 2023, 117: 102823.被引 3
  • Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
    Juvin, Carla*; Houssin, Laurent; Lopez, PierreCOMPUTERS & OPERATIONS RESEARCH, 2023, 152: 106156.被引 5
  • Two novel MILP models with different flexibilities for solving integrated process planning and scheduling problems
    Liu, Qihao; Li, Xinyu*; Gao, Liang; Fan, JiaxinJournal of the Operational Research Society, 2023, 74(9): 1955-1967.被引 4
查看全部 →

发表信息

论文状态
公开发表
期刊
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
发表日期
2020-06
卷期
第 93 卷
页码
102025
DOI
10.1016/j.omega.2019.01.003
语言
ENGLISH
期刊收录
NSL.SSCI.SCIE
期刊等级
1区
成果收录
SCIE

作者

  • B

    Barzanji, Ramin (第一作者)

  • N

    Naderi, Bahman (通讯)

查看全部 3 位作者收起作者
  • B

    Begen, Mehmet A.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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