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

A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study

Meeran, S.*; Morshed, M. S.
JOURNAL OF INTELLIGENT MANUFACTURING2012-8DOI: 10.1007/s10845-011-0520-x
66被引13阅读
引用收藏
分享

摘要

In recent decades many attempts have been made at the solution of Job Shop Scheduling Problem using a varied range of tools and techniques such as Branch and Bound at one end of the spectrum and Heuristics at the other end. However, the literature reviews suggest that none of these techniques are sufficient on their own to solve this stubborn NP-hard problem. Hence, it is postulated that a suitable solution method will have to exploit the key features of several strategies. We present here one such solution method incorporating Genetic Algorithm and Tabu Search. The rationale behind using such a hybrid method as in the case of other systems which use GA and TS is to combine the diversified global search and intensified local search capabilities of GA and TS respectively. The hybrid model proposed here surpasses most similar systems in solving many more traditional benchmark problems and real-life problems. This, the system achieves by the combined impact of several small but important features such as powerful chromosome representation, effective genetic operators, restricted neighbourhood strategies and efficient search strategies along with innovative initial solutions. These features combined with the hybrid strategy employed enabled the system to solve several benchmark problems optimally, which has been discussed elsewhere in Meeran and Morshed (8th Asia Pacific industrial engineering and management science conference, Kaohsiung, Taiwan, 2007). In this paper we bring out the system's practical usage aspect and demonstrate that the system is equally capable of solving real life Job Shop problems.

学科与关键词

关键词
Genetic algorithmsTabu searchJob shopSchedulingHybrid systems
相关
加载中…
  • Evaluation of a hybrid genetic tabu search framework on job shop scheduling benchmark problems
    Meeran, S.*; Morshed, M. S.International Journal of Production Research, 2014, 52(19): 5780-5798.被引 9
  • A hybrid algorithm with a new neighborhood structure for job shop scheduling problems
    Xie, Jin; Li, Xinyu; Gao, Liang*; Gui, LinCOMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169: 108205.被引 24
  • Improved Hybrid Heuristic Algorithm Inspired by Tissue-Like Membrane System to Solve Job Shop Scheduling Problem
    Tian, Xiang; Liu, Xiyu*Processes, 2021, 9(2): 219.被引 9
查看全部 →

发表信息

论文状态
公开发表
期刊
JOURNAL OF INTELLIGENT MANUFACTURING
发表日期
2012-08
卷期
第 23 卷, 第 4 期
页码
1063-1078
DOI
10.1007/s10845-011-0520-x
语言
ENGLISH
成果收录
SCIE

作者

  • M

    Meeran, S. (通讯) (第一作者)

  • M

    Morshed, M. S.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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