首页> 外文会议>International workshop on heuristics >Minimizing the Number of Tardy Jobs in a Flowshop
【24h】

Minimizing the Number of Tardy Jobs in a Flowshop

机译:最大限度地减少流程中的迟到的工作数量

获取原文

摘要

The aim of this paper is to propose an effective heuristic and a exact method for a scheduling problem. THe workshop is an hybrid flowshop, and the problem is to perform jobs between a release date and a due date, in order to minimize the number of tardy jobs. A linear programming formulation of the problem is proposed as an exact method. A greedy algorithm and a genetic algorithm are proposed as approximate methods. To evaluate these methods, experiments on instances like industrial ones are computed.
机译:本文的目的是提出有效的启发式和精确的调度问题方法。该研讨会是一个混合流动跳棋,问题是在发布日期和截止日期之间执行作业,以便最小化迟到的作业数量。提出了该问题的线性规划制剂作为精确的方法。提出了一种贪婪算法和遗传算法作为近似方法。为了评估这些方法,计算工业实体的实验。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号