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

A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems

Robert, R. B. Jeen*; Rajkumar, R.
Information Technology and Control2019DOI: 10.5755/j01.itc.48.1.20909
6被引3阅读
引用收藏
分享

摘要

In this work, a hybrid algorithm has been proposed to solve bi-objective permutation flow shop scheduling problem. The primary concern of flow shop scheduling problem considered in this work is to obtain the best sequence, which minimizes the makespan and the total flow time of all jobs. Bi-objective issues are comprehended by doling out uniform weight to every objective function in view of its preference or determining every competent solutions. In the flow shop scheduling environment, many meta-heuristic algorithms have been used to find optimal or near-optimal solutions due to the computational cost of determining exact solutions. This work provides a hybridization of genetic algorithm and simulated annealing algorithm (HGASA) based multi-objective optimization algorithm for flow shop scheduling. The proposed HGASA algorithm is used to solve a bi-objective problem that minimizes the makespan and the total flow time. The performance of the proposed algorithm is demonstrated by applying it to benchmark problems available in the OR-Library. The test results show that the HGASA algorithm performed better in terms of searching quality and efficiency than other meta-heuristic algorithms.

学科与关键词

关键词
Permutation Flow shop schedulingHybrid algorithmMakespanTotal Flow timeBenchmark
相关
加载中…
  • Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
    Zobolas, G. I.*; Tarantilis, C. D.; Ioannou, G.COMPUTERS & OPERATIONS RESEARCH, 2009, 36(4): 1249-1267.被引 117
  • ALGORITHMS FOR BICRITERIA MINIMIZATION IN THE PERMUTATION FLOW SHOP SCHEDULING PROBLEM
    Mokotoff, Ethel*Journal of Industrial and Management Optimization, 2011, 7(1): 253-282.被引 4
  • An adaptive hybrid metaheuristic for permutation flowshop scheduling
    Moccellin, JV*; dos Santos, MOCONTROL AND CYBERNETICS, 2000, 29(3): 761-771.被引 3
查看全部 →

发表信息

论文状态
公开发表
期刊
Information Technology and Control
发表日期
2019
卷期
第 48 卷, 第 1 期
页码
47-57
DOI
10.5755/j01.itc.48.1.20909
语言
ENGLISH
成果收录
SCIE

作者

  • R

    Robert, R. B. Jeen (通讯) (第一作者)

  • R

    Rajkumar, R.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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