...
首页> 外文期刊>Applied Mathematical Modelling >Single-machine scheduling with precedence constraints and position-dependent processing times
【24h】

Single-machine scheduling with precedence constraints and position-dependent processing times

机译:具有优先约束和位置相关处理时间的单机调度

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

摘要

In this paper we consider single-machine scheduling problems with position-dependent processing times, i.e., jobs whose processing times are an increasing or decreasing function of their positions in a processing sequence. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. It is shown that for the problems of minimization of the makespan polynomial algorithms exist.
机译:在本文中,我们考虑了与位置相关的处理时间的单机调度问题,即处理时间是其处理顺序中其位置的递增或递减函数的作业。此外,作业分别由平行链和串-平行图优先约束关联。结果表明,存在使makepan多项式算法最小化的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号