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

Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

Shams Lahroudi, Seyed Hassan; Mahalleh, Farzaneh; Mirkamali, Seyedsaeid*
COMPLEXITY2022-8-31DOI: 10.1155/2022/5043058
2被引6阅读
引用收藏
分享

摘要

Open Shop Scheduling Problem (OSSP) is one of the most important scheduling problems in the field of engineering and industry. This kind of problem includes m machines and n jobs, each job contains a certain number of operations, and each operation has a predetermined processing time on its corresponding machine. The order of processing of these operations affects the completion times of all jobs. Therefore, the purpose of OSSP is to achieve a proper order of processing of jobs using specified machines, so that the completion time of all jobs is minimized. In this paper, the strengths and limitations of three methods are evaluated by comparing the results of solving the OSSP in large-scale and small-scale benchmarks. In this case, the minimized completion time and total tardiness are considered the objective functions of the adapted methods. To solve small-scale problems, we adapt a mathematical model called Multiobjective Mixed Linear Programming (MOMILP). To solve large-scale problems, two metaheuristic algorithms including Multiobjective Parallel Genetic Algorithm (MOPGA) and Multiobjective Parallel Simulated Annealing (MOPSA) are adapted. In experimental results, we randomly generated small-scale problems to compare MOMILP with the Genetic Algorithm (GA) and Simulate Annealing (SA). To compare MOPSA and MOPGA with the state of the art and show their strengths and limitations, we use a standard large-scale benchmark. The simulation results of the proposed algorithms show that although the MOPSA algorithm is faster, the MOPGA algorithm is more efficient in achieving optimal solutions for large-scale problems compared with other methods.

学科与关键词

关键词
GENETIC ALGORITHMJOB-SHOPSMAKESPANMAINTENANCEMACHINESTIMES
相关
加载中…
  • 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
  • Scheduling multi-objective open shop scheduling using a hybrid immune algorithm
    Naderi, B.*; Mousakhani, M.; Khalili, M.INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66(5-8): 895-905.被引 14
  • Multiprocessor open shop problem: literature review and future directions
    Adak, Zeynep*; Arioglu Akan, Mahmure Ovul; Bulkan, SerolJOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40(2): 547-569.被引 13
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPLEXITY
发表日期
2022-08-31
卷期
第 2022 卷
页码
5043058
DOI
10.1155/2022/5043058
语言
ENGLISH
期刊等级
4区
成果收录
SCIE

作者

  • S

    Shams Lahroudi, Seyed Hassan (第一作者)

  • M

    Mahalleh, Farzaneh

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

    Mirkamali, Seyedsaeid (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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