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

Multiprocessor open shop problem: literature review and future directions

Adak, Zeynep*; Arioglu Akan, Mahmure Ovul; Bulkan, Serol
JOURNAL OF COMBINATORIAL OPTIMIZATION2020-8DOI: 10.1007/s10878-020-00591-3
13被引4阅读
引用收藏
分享

摘要

Multi-processor open shop (MPOS) is a combination of the classical open shop and parallel shop environments. Although there exist wide application areas of this shop environment in both production and service facilities, the research in the field is still limited. In this paper, we provided a detailed review of the research on MPOS problem. With this survey, we aimed to provide a helpful guide to those who are willing to contribute to this open field of study. We have reviewed the studies in MPOS literature under the following topics: mathematical formulations, polynomial-time optimum solution algorithms for few special cases, approximation algorithms, dispatching rules, heuristics and metaheuristics. We further presented test data used in the literature and investigated the ways researchers evaluated their results. Solution representation and parameter tuning in metaheuristic applications have been also covered in detail. There is considerable room for improvement, especially in terms of near-optimal solution approaches. We closely investigated research topics that need particular attention in future research. We believe the review here will be a good starting point to study MPOS problem, even for those who have no prior knowledge of the field.

学科与关键词

关键词
Multiprocessor open shopReviewSchedulingFlexible open shopOpen shop with parallel machines
相关
加载中…
  • Four decades of research on the open-shop scheduling problem to minimize the makespan
    Ahmadian, Mohammad Mahdi; Khatami, Mostafa; Salehipour, Amir*; Cheng, T. C. E.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 295(2): 399-426.被引 51
  • Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem
    Shams Lahroudi, Seyed Hassan; Mahalleh, Farzaneh; Mirkamali, Seyedsaeid*COMPLEXITY, 2022, 2022: 5043058.被引 2
  • New efficient heuristics for scheduling open shops with makespan minimization
    Abreu, Levi R.*; Prata, Bruno A.; Framinan, Jose M.; Nagano, Marcelo S.COMPUTERS & OPERATIONS RESEARCH, 2022, 142: 105744.被引 14
查看全部 →

发表信息

论文状态
公开发表
期刊
JOURNAL OF COMBINATORIAL OPTIMIZATION
发表日期
2020-08
卷期
第 40 卷, 第 2 期
页码
547-569
DOI
10.1007/s10878-020-00591-3
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
4区
成果收录
SCIE

作者

  • A

    Adak, Zeynep (通讯) (第一作者)

  • A

    Arioglu Akan, Mahmure Ovul

查看全部 3 位作者收起作者
  • B

    Bulkan, Serol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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