首页> 外文会议>International Conference on Methods and Models in Automation and Robotics >An Enumerative Algorithm for a Two-Machine Preemptive Job Scheduling with a Learning Effect
【24h】

An Enumerative Algorithm for a Two-Machine Preemptive Job Scheduling with a Learning Effect

机译:一种具有学习效果的双机抢占作业调度的枚举算法

获取原文

摘要

We consider a two-machine scheduling problem with a learning effect and the objective to minimize the schedule length. Jobs are preemptable but only preemption of a single job is allowed. We present basic properties of this problem and an enumerative algorithm for its exact solution.
机译:我们考虑了一个具有学习效果的双机调度问题,目标最小化了时间表长度。工作是抢先的,但只允许抢占一份工作。我们为其确切解决方案呈现了这个问题的基本属性和枚举算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号