...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm
【24h】

Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm

机译：通过运输时间安排灵活的工场：数学模型和混合帝国主义竞争算法

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

摘要

After the completion of a job on a machine, it needs to be transported to the next machine, actually taking some time. However, the transportation times are commonly neglected in the literature. This paper incorporates the transportation times between the machines into the flexible job-shop scheduling problem. We mathematically formulate the problem by two mixed integer linear programming models. Since the problem is NP-hard, we propose an adaptation of the imperialist competitive algorithm hybridized by a simulated annealing-based local search to solve the problem. Various operators and parameters of the algorithm are calibrated using the Taguchi method. The presented algorithm is assessed by comparing it against two other competitive algorithms in the literature. The computational results show that this algorithm has an outstanding performance in solving the problem.
机译：在机器上完成作业后，需要将其传输到下一台机器，实际上需要一些时间。但是，运输时间在文献中通常被忽略。本文将机器之间的运输时间纳入了灵活的车间调度问题。我们用两个混合整数线性规划模型在数学上表达问题。由于该问题是NP难题，因此我们提出了一种帝国主义竞争算法的改编方案，该算法与基于模拟退火的本地搜索混合以解决该问题。使用Taguchi方法校准算法的各种运算符和参数。通过将其与文献中的其他两种竞争算法进行比较来评估所提出的算法。计算结果表明，该算法在解决该问题上具有突出的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号