首页> 外文会议>Science and technology to promote harmonized production >A SCHEDULING METHOD FOR HYBRID FLOWSHOPSCHEDULING PROBLEM: PROPOSAL OF THE CHAIN ASSIGNMENT OF JOBS BY EARLIEST STARTING TIME
【24h】

A SCHEDULING METHOD FOR HYBRID FLOWSHOPSCHEDULING PROBLEM: PROPOSAL OF THE CHAIN ASSIGNMENT OF JOBS BY EARLIEST STARTING TIME

机译:混合流调度问题的调度方法:建议尽早开始作业链的分配

获取原文
获取原文并翻译 | 示例

摘要

This paper targets the Hybrid Flow Shop scheduling problem, which consists of series of production stages, each of which has multiple machines operating in parallel. This problem is difficult to be solved because of its problem size and structure. An assignment rule ‘Chain Assignment of Jobs by Earliest Starting Time' is proposed to downsize the problem without lost of the optimality. In the computational experiments, the proposed method shows its optimality by being compared with the Johnson's rule, and other previous methods.
机译:本文针对混合流水车间调度问题,该问题由一系列生产阶段组成,每个阶段都有多台并行运行的机器。由于其问题的大小和结构,很难解决该问题。提出了一种分配规则“按最早开始时间对作业进行链式分配”,以缩小问题的范围,而不会失去最优性。在计算实验中,所提出的方法通过与约翰逊法则和其他先前方法进行比较来显示其最优性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号