• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computers & operations research >A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
【24h】

A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times

机译：带有禁忌搜索程序的遗传算法，用于在运输约束和有限处理时间的情况下进行灵活的车间调度

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

摘要

In this paper, we propose a model for Flexible Job Shop Scheduling Problem (FJSSP) with transportation constraints and bounded processing times. This is a NP hard problem. Objectives are to minimize the makespan and the storage of solutions. A genetic algorithm with tabu search procedure is proposed to solve both assignment of resources and sequencing problems on each resource. In order to evaluate the proposed algorithm's efficiency, five types of instances are tested. Three of them consider sequencing problems with or without assignment of processing or/and transport resources. The fourth and fifth ones introduce bounded processing times which mainly characterize Surface Treatment Facilities (STFs). Computational results show that our model and method are efficient for solving both assignment and scheduling problems in various kinds of systems.
机译：在本文中，我们提出了一个具有运输约束和有限处理时间的柔性作业车间调度问题（FJSSP）模型。这是一个NP难题。目的是最大程度地缩短制造周期和解决方案的存储。提出了一种具有禁忌搜索过程的遗传算法，既解决了资源分配问题又解决了每种资源的排序问题。为了评估所提出算法的效率，测试了五种实例。他们中的三个考虑有或没有分配处理或/和传输资源的排序问题。第四和第五部分介绍了有限的处理时间，这主要是表面处理设施（STF）的特征。计算结果表明，我们的模型和方法可有效解决各种系统中的分配和调度问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号