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

New efficient heuristics for scheduling open shops with makespan minimization

Abreu, Levi R.*; Prata, Bruno A.; Framinan, Jose M.; Nagano, Marcelo S.
COMPUTERS & OPERATIONS RESEARCH2022-6DOI: 10.1016/j.cor.2022.105744
14被引7阅读
引用收藏
分享

摘要

This paper deals with the so-called Open Shop Scheduling Problem (OSSP) with makespan objective, which consists of scheduling a set of jobs that must visit a set of machines in no established order so the maximum completion time among the jobs is minimized. This problem is known to be NP-hard, and the absence of specific routes for the processing of the jobs makes its solution space extremely large. In this work we propose several efficient constructive heuristics that exploit some specific properties of the OSSP. We carry out an extensive computational experience using problem instances taken from the related literature to assess the performance of the proposed algorithms as compared to existing ones with respect to the quality of the solutions and the CPU time required. The extensive computational tests show the excellent performance of the heuristics proposed, resulting in the best-so-far heuristics for the problem.

学科与关键词

关键词
Production schedulingCombinatorial optimizationHeuristicsOpen shop
相关
加载中…
  • 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
  • A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
    Mejia, Gonzalo; Yuraszeck, FranciscoEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 285(2): 484-496.被引 32
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPUTERS & OPERATIONS RESEARCH
发表日期
2022-06
卷期
第 142 卷
页码
105744
DOI
10.1016/j.cor.2022.105744
语言
ENGLISH
成果收录
SCIE
资助标注
Coordination for the Improvement of Higher Education Personnel (CAPES) [88882.379108/2019-01]; National Council for Scientific and Technological Development (CNPq) [404232/2016-7, 306075/2017-2, 430137/2018-4, 303594/2018-7, 312585/2021-7, 407151/2021-4]; Sao Paulo Research Foundation (FAPESP) [2020/16341-5]; Spanish Ministry of Science and Education (ASSORT project) [PID2019-108756RB-I00]; Andalusian Government [P18-FR-1149, US-1264511]

作者

  • A

    Abreu, Levi R. (通讯) (第一作者)

  • P

    Prata, Bruno A.

查看全部 4 位作者收起作者
  • F

    Framinan, Jose M.

  • N

    Nagano, Marcelo S.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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