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

A matheuristic approach to the multi-mode resource constrained project scheduling problem

Fernandes, Gustavo Alves; de Souza, Sergio Ricardo*
COMPUTERS & INDUSTRIAL ENGINEERING2021-12DOI: 10.1016/j.cie.2021.107592
10被引2阅读
引用收藏
分享

摘要

This article addresses the Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP). It is an NPHard problem and consists of scheduling all activities of a project, respecting the precedence order of these activities, which, once initiated, cannot be interrupted. Jobs have combinations of execution modes, in the form of different combinations of processing time and resource consumption. The objective is to minimize the duration of the project, finding start times for each project activity. This article proposes a Local Branching matheuristic strategy for solving MRCPSP. The influence of the parameters of the based local search method is verified, as well as the characterization of neighborhood structures that define a subproblem during the enumeration of the LB matheuristic. Two characterizations to define the subproblems are proposed, and one of them surpasses the characterization discussed in the literature. Computational tests were performed using sets of instances from the PSPLIB and MMLIB libraries. The best-known results for these instances in relation to the state-of-the-art are presented as a reference to validate the results obtained by the approach proposed in this article.

学科与关键词

关键词
Multi-mode resource-constrained projectscheduling problemMatheuristicLocal branchingProject scheduling
相关
加载中…
  • An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem
    Etminaniesfahani, Alireza*; Gu, Hanyu; Naeni, Leila Moslemi; Salehipour, AmirAnnals of Operations Research, 2024, 338(1): 41-68.被引 1
  • A matheuristic for the resource-constrained project scheduling problem
    Vanhoucke, Mario*; Coelho, JoseEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 319(3): 711-725.被引 1
  • A memetic algorithm to address the multi-node resource-constrained project scheduling problem
    Machado-Dominguez, Luis F.*; Paternina-Arboleda, Carlos D.; Velez, Jorge, I; Barrios-Sarmiento, AgustinJOURNAL OF SCHEDULING, 2021, 24(4): 413-429.被引 6
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & INDUSTRIAL ENGINEERING
发表日期
2021-12
卷期
第 162 卷
页码
107592
DOI
10.1016/j.cie.2021.107592
语言
MULTI-LANGUAGE
期刊等级
2区
成果收录
SCIE
资助标注
Coordination for the Improvement of Higher Education Personnel (CAPES); Minas Gerais State Research Foundation (FAPEMIG); National Council of Technological and Scientific Development (CNPq); Federal Center of Technological Education of Minas Gerais (CEFET-MG); Coordination for the Improvement of Higher Education Personnel (CAPES) -Brazil [001]

作者

  • F

    Fernandes, Gustavo Alves (第一作者)

  • d

    de Souza, Sergio Ricardo (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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