...
首页> 外文期刊>Journal of Applied Mathematics and Computing >Single machine scheduling problems with position-dependent processing times
【24h】

Single machine scheduling problems with position-dependent processing times

机译:单机调度问题与位置相关的处理时间

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

摘要

We consider single machine scheduling problems in which the processing time of a job depends on its position in a processing sequence. The objectives are to minimize the weighted sum of completion times, to minimize the maximum lateness and to minimize the number of tardy jobs. For some special cases, we prove that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore’s algorithm can construct an optimal sequence for these objective functions, respectively. For the general cases, we also give the worst-case bound of these three rules.
机译:我们考虑单机调度问题,其中作业的处理时间取决于其在处理序列中的位置。 目标是最大限度地减少重量的完成时间,以最大限度地减少最大迟到和最小化迟到的工作数量。 对于一些特殊情况,我们证明了加权最短处理时间(WSPT)规则,最早的截止日期(EDD)规则和MOORE的算法分别为这些目标函数分别构造最佳序列。 对于一般案件,我们还提供了这三个规则的最坏情况。

著录项

  • 来源
  • 作者单位

    Department of Science Shenyang Institute of Aeronautical Engineering Shenyang 110136 People’s Republic of China;

    Department of Science Shenyang Institute of Aeronautical Engineering Shenyang 110136 People’s Republic of China;

    Department of Science Shenyang Institute of Aeronautical Engineering Shenyang 110136 People’s Republic of China;

    Department of Science Shenyang Institute of Aeronautical Engineering Shenyang 110136 People’s Republic of China;

    Department of Science Shenyang Institute of Aeronautical Engineering Shenyang 110136 People’s Republic of China;

    Department of Science Shenyang Institute of Aeronautical Engineering Shenyang 110136 People’s Republic of China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 数学;
  • 关键词

    Scheduling; Single machine; Learning effect;

    机译:调度;单机;学习效果;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号