首页> 外文期刊>Mathematical Problems in Engineering >Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times
【24h】

Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times

机译:具有恶化的单机小组调度问题以最小化完成时间的总和

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

摘要

We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.
机译:我们考虑了两个单机小组调度问题,这些小组调度问题恶化了小组设置和工作处理时间。即,作业处理时间和组设置时间是其开始时间的线性增加(或减少)的函数。每个组中的工作恶化率相同。计划问题的目的是使完成时间的总和最小化。我们表明,在满意的条件下,完成时间最小化问题的总和仍可以多项式求解。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2012年第11期|275239.1-275239.9|共9页
  • 作者

    Yong He; Li Sun;

  • 作者单位

    School of Economics and Management, Southeast University, Nanjing 210096, China;

    School of Economics and Management, Southeast University, Nanjing 210096, China,Foundation Department, Huaiyin Advanced Vocational and Technical Health School, Huaian 223300, China;

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

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号