...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
【24h】

A variable neighbourhood search algorithm for the flexible job-shop scheduling problem

机译：柔性作业车间调度问题的可变邻域搜索算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The flexible job-shop scheduling problem (FJSP) is a generalisation of the classical job-shop scheduling problem which allows an operation of each job to be executed by any machine out of a set of available machines. FJSP consists of two sub-problems which are assigning each operation to a machine out of a set of capable machines (routing sub-problem) and sequencing the assigned operations on the machines (sequencing sub-problem). This paper proposes a variable neighbourhood search (VNS) algorithm that solves the FJSP to minimise makespan. In the process of the presented algorithm, various neighbourhood structures related to assignment and sequencing problems are used for generating neighbouring solutions. To compare our algorithm with previous ones, an extensive computational study on 181 benchmark problems has been conducted. The results obtained from the presented algorithm are quite comparable to those obtained by the best-known algorithms for FJSP.
机译：灵活的作业车间调度问题（FJSP）是经典作业车间调度问题的概括，它允许由一组可用机器中的任何机器执行每个作业的操作。 FJSP由两个子问题组成，这两个子问题是将一组机器中的每个操作分配给一台机器（路由子问题），并对机器上分配的操作进行排序（排序子问题）。本文提出了一种可变邻域搜索（VNS）算法，该算法解决了FJSP从而最大程度地缩短了制造时间。在提出的算法的过程中，与分配和排序问题有关的各种邻域结构被用于生成相邻解。为了将我们的算法与以前的算法进行比较，已经对181个基准问题进行了广泛的计算研究。从提出的算法获得的结果与通过FJSP的最著名算法获得的结果相当。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号