...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Flexible job-shop scheduling problem with resource recovery constraints
【24h】

Flexible job-shop scheduling problem with resource recovery constraints

机译：具有资源恢复约束的灵活的车间调度问题

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

摘要

In this work, we introduce a Flexible Job-shop Scheduling Problem with Resource Recovery Constraints (FRRC). In the FRRC, besides the constraints of the classical Flexible Job-shop Scheduling Problem (FJSP), operations may require resources to be processed. The resources are available in batches and a recovery time is required between each batch. This problem is inspired by a real situation faced by a brewing company where different yeasts are available in a limited quantity and are recovered only once they have been completely used. The objective is to schedule the operations such that the makespan is minimised. A mathematical model and a metaheuristic based on a General Variable Neighborhood Search is proposed for the solution of the FRRC. Computational results over a large set of instances, adapted from the FJSP literature, are presented.
机译：在这项工作中，我们介绍了具有资源恢复约束（FRRC）的灵活的Job-shop调度问题。在FRRC中，除了经典的灵活作业车间调度问题（FJSP）的约束外，操作可能还需要处理资源。这些资源可以分批使用，并且每批之间需要恢复时间。酿造公司面临的实际情况激发了这个问题，在这种情况下，酵母数量有限，只有完全使用后才能回收。目的是安排操作，以使制造期最小化。提出了基于通用可变邻域搜索的数学模型和元启发式算法。给出了根据FJSP文献改编的大量实例的计算结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号