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

MINIMIZING TOTAL FLOW TIME IN PERMUTATION FLOWSHOP ENVIRONMENT

Lin, Shih-Wei; Huang, Chien-Yi; Lu, Chung-Cheng; Yng, Kuo-Ching*chang gung univ
International Journal of Innovative Computing, Information and Control2012-10
5被引10阅读
引用收藏
分享

摘要

The permutation flowshop scheduling problem with the objective of minimizing total flow time is known as a NP-hard problem, even for the two-machine cases. Because of the computational complexity of this problem, a multi-start simulated annealing (MSA) heuristic, which adopts a multi-start hill climbing strategy in the simulated annealing (SA) heuristic, is proposed to obtain close-to-optimal solutions. To examine the performance of the MSA algorithm, a set of computational experiments was conducted on a well-known benchmark-problem set from the literature. The experiment results show that the performance of the traditional single-start SA can be significantly improved by incorporating the multi-start hill climbing strategy. In addition, the proposed MSA algorithm is highly effective and efficient as compared with the other state-of-the-art meta-heuristics on the same benchmark-problem instances. In terms of both solution quality and computational expense, the proposed algorithm contributes significantly to this extremely challenging scheduling problem.

学科与关键词

关键词
SchedulingPermutation flowshopTotal flow time
相关
加载中…
  • 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
  • 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 Control, 2019, 48(1): 47-57.被引 6
查看全部 →

发表信息

论文状态
公开发表
期刊
International Journal of Innovative Computing, Information and Control
发表日期
2012-10
卷期
第 8 卷, 第 10A 期
页码
6599-6612
成果收录
SCIE
资助标注
National Science Council of Taiwan [NSC99-2628-E-027-003, NSC99-2410-H-182-023-MY2]

作者

  • L

    Lin, Shih-Wei (第一作者)

    chang gung univ

  • H

    Huang, Chien-Yi

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

    Lu, Chung-Cheng

  • Y

    Yng, Kuo-Ching (通讯)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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