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

A matheuristic-oriented iterated greedy algorithm for multi-mode resource-constrained project scheduling problem under uncertainty

Gao, Zheng; Zhang, Liping; Yu, Puliang*; Zhang, Zikai; Li, Zixiangwuhan univ sci & technol
COMPUTERS & INDUSTRIAL ENGINEERING2024-7DOI: 10.1016/j.cie.2024.110333
3阅读
引用收藏
分享

摘要

Multi-mode resource-constrained project scheduling problem is one of the most important branches of combinatorial optimization problems. The aim is to find a feasible solution consisting of activity start time and execution mode so that the project makespan is minimized. However, there are a lot of uncertain events, that bring great challenges to project scheduling. We first propose a mixed integer linear programming model where the activity duration is uncertain. Then two uncertain parameters are introduced to describe the disturbance degree of uncertain activity duration and the allowable violation degree of constraints respectively, and the MILP model with uncertain activity duration is converted to its deterministic robust counterpart model. A matheuristic local optimization approach is proposed to balance computational time with the optimization of the computational result. A matheuristic-oriented iterated greedy algorithm that combines a matheuristic local optimization approach and an iterated greedy algorithm is proposed to solve this problem in this paper. Experimental results indicate that the robust counterpart model can obtain robust optimal solutions for small-scale instances in accepted computational time. Meanwhile, the proposed matheuristic-oriented iterated greedy algorithm can obtain robust near-optimal solutions for large-scale instances and is superior to other compared algorithms.

学科与关键词

关键词
Project schedulingUncertaintyRobust counterpart modelMixed integer linear programmingMatheuristic
相关
加载中…
  • A robust optimization approach for the multi-mode resource-constrained project scheduling problem
    Balouka, Noemie; Cohen, Izack*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291(2): 457-470.被引 62
  • A matheuristic approach to the multi-mode resource constrained project scheduling problem
    Fernandes, Gustavo Alves; de Souza, Sergio Ricardo*COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 162: 107592.被引 10
  • Multi-mode resource-constrained project scheduling with uncertain activity cost
    Xie, Fang; Li, Haitao*; Xu, Zhe*EXPERT SYSTEMS WITH APPLICATIONS, 2021, 168: 114475.被引 26
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & INDUSTRIAL ENGINEERING
发表日期
2024-07
卷期
第 193 卷
页码
110333
DOI
10.1016/j.cie.2024.110333
语言
MULTI-LANGUAGE
成果收录
SCIE
资助标注
National Natural Science Foundation of China [52275504, 62303358]

作者

  • G

    Gao, Zheng (第一作者)

    wuhan univ sci & technol

  • Z

    Zhang, Liping

    wuhan univ sci & technol

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

    Yu, Puliang (通讯)

    wuhan univ sci & technol

  • Z

    Zhang, Zikai

    wuhan univ sci & technol

  • L

    Li, Zixiang

    wuhan univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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