Scholarlink

<p>The manufacturing industry is the backbone of the national economy. The job shop scheduling problem (JSP) is a critical issue in the field of production and manufacturing, and it holds significant research value. A hybrid genetic tabu search algorithm (HGTSA) is introduced, which combines the global search ability of the genetic algorithm (GA) and the local search ability of the tabu search (TS), with the goal of minimizing makespan. Based on an analysis of prominent neighborhood structures, this paper theoretically establishes the criterion for identifying invalid movement of operations within the critical block, a multi-operation joint movement neighborhood structure involving three pairs of operations is devised and denoted as N8-transpose with 2-machine-transpose (N8T+2MT), which can guide the effective movement of operations. Additionally, to avoid premature convergence, a search method based on scheduling partial reconstruction and some other enhanced genetic operators are introduced. The effectiveness of HGTSA is verified by comparing with other state-of-the-art algorithms on the JSP benchmarks, the experimental results demonstrate specific advantages of the N8T+2MT.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A hybrid genetic tabu search algorithm based on a multi-operation joint movement neighborhood structure for job shop scheduling problems

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年8月1日

查看全文
  • Lei Wang,
  • Kongfu Hu,
  • Jingcao Cai,
  • Long Cheng,
  • Yuan Xiong,
  • Jiawei Ren,
  • Qiangqiang Xia

摘要

The manufacturing industry is the backbone of the national economy. The job shop scheduling problem (JSP) is a critical issue in the field of production and manufacturing, and it holds significant research value. A hybrid genetic tabu search algorithm (HGTSA) is introduced, which combines the global search ability of the genetic algorithm (GA) and the local search ability of the tabu search (TS), with the goal of minimizing makespan. Based on an analysis of prominent neighborhood structures, this paper theoretically establishes the criterion for identifying invalid movement of operations within the critical block, a multi-operation joint movement neighborhood structure involving three pairs of operations is devised and denoted as N8-transpose with 2-machine-transpose (N8T+2MT), which can guide the effective movement of operations. Additionally, to avoid premature convergence, a search method based on scheduling partial reconstruction and some other enhanced genetic operators are introduced. The effectiveness of HGTSA is verified by comparing with other state-of-the-art algorithms on the JSP benchmarks, the experimental results demonstrate specific advantages of the N8T+2MT.