...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computers & operations research >Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
【24h】

Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem

机译：基于机器怠速时间的优势条件确定置换流程调度问题

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

摘要

In this study, we investigate the lower bound and dominance conditions of the N-job and M-machine permutation flowshop scheduling problem to minimize the makespan based on machine idle times. We have developed and validated three dominance conditions and a lower bound based on a new approach that minimizes the machine idle times in a flowshop to facilitate the efficiency of the branch and bound approach. Most importantly, we have developed a dominance condition that is independent of the preceding and subsequent partial schedules, which has been considered critical but has not previously been developed in flowshop scheduling research. Finally, the efficiency of our developed branch and bound approach based on machine idle times is compared with the efficiencies of some previous branch and bound algorithms from the literature. We show that the dominance conditions that we developed can significantly improve the efficiency of the branch and bound approach. (C) 2020 Elsevier Ltd. All rights reserved.
机译：在这项研究中，我们调查了N-作业和M机置换流程调度问题的下限和优势条件，以基于机器怠速时间最小化MEPESPHAN。我们已经开发并验证了三个优势条件和基于新方法的下限，以便在流程中最小化机器怠速时间，以促进分支和拟订方法的效率。最重要的是，我们开发了一个独立于前后部分时间表的优势条件，其被认为是至关重要的，但以前尚未在流程调度研究中开发。最后，基于机器怠速时间的发达分支和拟订方法的效率与文献中的一些前分支和绑定算法的效率进行了比较。我们展示了我们开发的主要条件可以显着提高分支机构和拟订方法的效率。 （c）2020 elestvier有限公司保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号