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

A matheuristic for the resource-constrained project scheduling problem

Vanhoucke, Mario*; Coelho, Jose
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2024-12-16DOI: 10.1016/j.ejor.2024.07.016
1被引1阅读
引用收藏
分享

摘要

This paper presents a matheuristic solution algorithm to solve the well-known resource-constrained project scheduling problem (RCPSP). The problem makes use of a restricted neighbourhood method using an activity selection and a search space restriction module and implements them as two alternative search algorithms. The first algorithm makes use of the best-performing components of the branch-and-bound procedures from the literature, and embeds them into a greedy neighbourhood search. The second matheuristic implements the exact branch-and-bound procedures into a known and well-performing meta-heuristic search algorithm. Computational experiments have been carried out on seven different datasets consisting of 10,000+ project instances. Experiments reveal that the choice of exact algorithm is key in finding high-quality solutions, and illustrate that the trade-off between selecting an activity set size and search space restriction depends on the specific implementation. The computational tests demonstrate that the matheuristic discovered 24 new best known solutions that could not be found by either a meta-heuristic or an exact method individually. Moreover, a new benchmark dataset has been proposed that can be used to develop new matheuristic search procedures to solve the problem consisting of 461 instances from the literature.

学科与关键词

关键词
Project schedulingMatheuristicBranch-and-boundProject network indicatorNeighbourhood search
相关
加载中…
  • 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
  • An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances
    Van Peteghem, Vincent; Vanhoucke, Mario*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235(1): 62-72.被引 127
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2024-12-16
卷期
第 319 卷, 第 3 期
页码
711-725
DOI
10.1016/j.ejor.2024.07.016
语言
ENGLISH
成果收录
SCIE
资助标注
Ghent University, Belgium; FWO, Belgium; Flemish Government-department EWI, Belgium

作者

  • V

    Vanhoucke, Mario (通讯) (第一作者)

  • C

    Coelho, Jose

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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