...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >Evaluation of mathematical models for flexible job-shop scheduling problems
【24h】

Evaluation of mathematical models for flexible job-shop scheduling problems

机译：灵活的作业车间调度问题的数学模型评估

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

摘要

With the rapid development in computer technologies, mathematical programming-based technique to solve scheduling problems is significantly receiving attention from researchers. Although, it is not efficient solution method due to the NP-hard structure of these problems, mathematical programming formulation is the first step to develop an effective heuristic. Numerous comparative studies for variety scheduling problems have appeared over the years. But in our search in literature there is not an entirely review for mathematical formulations of flexible job shop scheduling problems (FJSP). In this paper, four the most widely used formulations of the FJSP are compiled from literature and a time-indexed model for FJSP is proposed. These formulations are evaluated under three categories that are distinguished by the type of binary variable that they rely on for using of sequencing operations on machines. All five formulations compared and results are presented.
机译：随着计算机技术的飞速发展，基于数学编程的解决调度问题的技术受到了研究者的极大关注。尽管由于这些问题的NP硬结构，它不是有效的解决方法，但是数学编程公式是开发有效启发式算法的第一步。这些年来，已经出现了许多有关品种调度问题的比较研究。但是，在我们的文献搜索中，没有完整地回顾柔性作业车间调度问题（FJSP）的数学公式。本文从文献中汇编了四种最广泛使用的FJSP公式，并提出了FJSP的时间索引模型。这些公式在以下三个类别中进行评估，它们根据在计算机上使用排序操作所依赖的二进制变量的类型进行区分。比较了所有五个配方并给出了结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号