首页> 外文会议>Combinatorial optimization and applications >Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability Constraints
【24h】

Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability Constraints

机译:具有恶化效应,学习效应,建立时间和可用性约束的单机调度的最佳策略

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

摘要

In this paper, we introduce a single-machine scheduling model considering all of the following parameters: general deterioration and learning effects as well as general setup times. We prove that the shortest processing time (SPT) rule produces optimal schedules for the following seven minimization objectives: makespan, sum of αth (α ≥ 0) power of jobs' completion times, total weighted completion time, maximum lateness, total tardiness, total weighted tardiness, and number of tardy jobs. We further show that in the case of resumable scheduling with availability constraints, the above conclusions are still valid.
机译:在本文中,我们介绍了一种考虑以下所有参数的单机调度模型:一般性能下降和学习效果以及一般设置时间。我们证明最短处理时间(SPT)规则可为以下七个最小化目标产生最佳计划:制造时间,作业完成时间的αth(α≥0)次幂,总加权完成时间,最大延迟,总拖延时间,总计迟到的加权和迟到的工作数量。我们进一步表明,在具有可用性约束的可恢复调度的情况下,以上结论仍然有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号