首页> 外文期刊>Procedia Computer Science >Tabu-search optimization approach for no-wait hybrid flow-shop scheduling with dedicated machines
【24h】

Tabu-search optimization approach for no-wait hybrid flow-shop scheduling with dedicated machines

机译:带有专用机器的无等待混合流量店调度的禁忌优化方法

获取原文
           

摘要

In this paper, the no-wait two-stage hybrid flow shop scheduling problem, under makespan minimization is addressed. A special attention will also be given to solutions with no-idle time as such solution limits material waste. We compare the performance of two metaheuristics, that are Tabu search (TS) and Genetic Algorithm (GA). For both approaches, when two solutions have the same makespan, the one with zero or smaller idle time is privileged.
机译:在本文中,解决了Mepespan最小化下的不等待两级混合流量储存问题。当这种解决方案限制材料废物时,还将特别注意具有无空闲时间的解决方案。我们比较两种成分术的性能,即禁忌搜索(TS)和遗传算法(GA)。对于这两种方法,当两个解决方案具有相同的MEAKESP时,空闲时间零或更小的空闲时间的特权。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号