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

Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey

Durasevic, Marko*; Jakobovic, Domagoj
Artificial Intelligence Review2023-4DOI: 10.1007/s10462-022-10247-9
35被引10阅读
引用收藏
分享

摘要

Scheduling has an immense effect on various areas of human lives, be it though its application in manufacturing and production industry, transportation, workforce allocation, or others. The unrelated parallel machines scheduling problem (UPMSP), which is one of the various problem types that exist, found its application in many areas like manufacturing and distributed computing. Due to the complexity of the problem, heuristic and metaheuristic methods have dominantly been applied for solving it. Although this problem variant did not receive much attention as other models, recent years saw the increase of research dealing with the UPMSP. During that time, different problem variants, solution methods, and interesting research directions were considered. However, no study provided a systematic overview of the research in which heuristic methods are applied for solving the UPMSP. This comes as a problem since it is becoming difficult to keep track of all the relevant research directions and solution methods considered for this problem. Therefore, the goal of this study is to provide an extensive literature review on the application of heuristic and metaheuristic methods for solving the UPMSP. Each reviewed study is briefly described based on the considered problem and solution method. Additionally, studies dealing with similar problems are grouped together to outline the evolution of the research, and possible areas where further research can be carried out. All studies were systematised and classified into several categories to allow for an easy overview of different problem and solution variants. Finally, recent research trends and possible future directions are also outlined.

学科与关键词

关键词
Unrelated parallel machinesSchedulingDispatching rulesMetaheuristicsHeuristics
相关
加载中…
  • Exact and metaheuristic approaches for unrelated parallel machine scheduling
    Moser, Maximilian; Musliu, Nysret; Schaerf, Andrea; Winter, Felix*JOURNAL OF SCHEDULING, 2022, 25(5): 507-534.被引 23
  • Local search based methods for scheduling in the unrelated parallel machines environment
    Ulaga, Lucija; Durasevic, Marko*; Jakobovic, DomagojEXPERT SYSTEMS WITH APPLICATIONS, 2022, 199: 116909.被引 7
  • An Evolutionary Variable Neighbourhood Search for the Unrelated Parallel Machine Scheduling Problem
    Abdullah, Salwani; Turky, Ayad; Nazri, Mohd Zakree Ahmad; Sabar, Nasser R.*IEEE Access, 2021, 9: 42857-42867.被引 4
查看全部 →

发表信息

论文状态
公开发表
期刊
Artificial Intelligence Review
发表日期
2023-04
卷期
第 56 卷, 第 4 期
页码
3181-3289
DOI
10.1007/s10462-022-10247-9
语言
ENGLISH
成果收录
SCIE
资助标注
Croatian Science Foundation [IP-2019-04-4333]

作者

  • D

    Durasevic, Marko (通讯) (第一作者)

  • J

    Jakobovic, Domagoj

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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