...
首页> 外文期刊>International Journal of Advances in Soft Computing and Its Applications >A Modified Bee Colony Optimization with Local Search Approach for Job Shop Scheduling Problems Relevant to Bottleneck Machines
【24h】

A Modified Bee Colony Optimization with Local Search Approach for Job Shop Scheduling Problems Relevant to Bottleneck Machines

机译:与瓶颈机器相关的车间作业调度问题的局部搜索改进蜂群算法

获取原文
   

获取外文期刊封面封底 >>

       

摘要

The job shop scheduling problem (JSSP) is regarded as one of the problems which is widely studied. This paper presents a bee colony optimization (BCO) algorithm with a local search named the modified two-enhancement scheme with neighbourhood N5 perturbati
机译:作业车间调度问题(JSSP)被认为是被广泛研究的问题之一。本文提出了一种具有局部搜索的蜂群优化(BCO)算法,该算法名为具有邻域N5扰动的改进的两次增强方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号