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

Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem

Meng, Leilei; Zhang, Chaoyong*; Ren, Yaping; Zhang, Biao; Lv, Chang华中科技大学
COMPUTERS & INDUSTRIAL ENGINEERING2020-4DOI: 10.1016/j.cie.2020.106347
178被引1阅读
引用收藏
分享

摘要

This paper intends to address the distributed flexible job shop scheduling problem (DFJSP) with minimizing maximum completion time (makespan). In order to solve this problem, we propose four mixed integer linear programming (MILP) models as well as a constraint programming (CP) model, among which four MILP models are formulated based on four different modeling ideas. MILP models are effective in solving small-scaled problems to optimality. DFJSP is NP-hard, therefore, we propose an efficient constraint programming (CP) model based on interval decision variables and domain filtering algorithms. Numerical experiments are conducted to evaluate the performance of the proposed MILP models and CP model. The results show that the sequence-based MILP model is the most efficient one, and the proposed CP model is effective in finding good quality solutions for the both the small-sized and large-sized instances. The CP model incomparably outperforms the state-of-the-art algorithms and obtains new best solutions for 11 benchmark problems. Moreover, the best MILP model and CP model have proved the optimality of 62 best-known solutions.

学科与关键词

关键词
Distributed flexible job shop scheduling problemMixed integer linear programmingConstraint programmingMakespan
相关
加载中…
  • Constraint programming models for the hybrid flow shop scheduling problem and its extensions
    Isik, Eyup Ensar; Yildiz, Seyda Topaloglu*; Akpunar, Ozge SatirSOFT COMPUTING, 2023, 27(24): 18623-18650.被引 3
  • Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
    Gogos, Christos*Applied Sciences-Basel, 2023, 13(23): 12562.被引 2
  • MILP Modeling and Optimization of Energy- Efficient Distributed Flexible Job Shop Scheduling Problem
    Meng, Leilei*; Ren, Yaping; Zhang, Biao; Li, Jun-Qing; Sang, Hongyan; Zhang, ChaoyongIEEE Access, 2020, 8: 191191-191203.被引 34
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & INDUSTRIAL ENGINEERING
发表日期
2020-04
卷期
第 142 卷
页码
106347
DOI
10.1016/j.cie.2020.106347
语言
MULTI-LANGUAGE
期刊收录
NSL.SCIE
期刊等级
2区
成果收录
SCIE
资助标注
Project of International Cooperation and Exchanges NSFC [51861165202]; Key Research and Development Program of Guangdong Province [2019B090921001]; National Natural Science Foundation of China [51575211, 51705263, 51805330]

作者

  • M

    Meng, Leilei (第一作者)

    liaocheng univ · huazhong univ sci & technol

  • Z

    Zhang, Chaoyong (通讯)

    huazhong univ sci & technol

查看全部 5 位作者收起作者
  • R

    Ren, Yaping

  • Z

    Zhang, Biao

    liaocheng univ

  • L

    Lv, Chang

    huazhong univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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