...
首页> 外文期刊>Mathematical Methods of Operations Research >A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
【24h】

A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times

机译:具有发布日期和恶化的处理时间的单机调度问题的动态规划算法

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

摘要

We consider a scheduling problem in which the processing time of each job deteriorates, i.e. it increases as time passes after the release date of the job. We present a dynamic programming algorithm coupled with upper bounding and lower bounding techniques to compute exact solutions. We report on problem instances of different size and we analyze the dependence between the ranges to which the data belong and the computing time.
机译:我们考虑了一个调度问题,其中每个作业的处理时间都会恶化,即随着作业发布日期之后时间的流逝而增加。我们提出一种动态编程算法,结合上限和下限技术来计算精确解。我们报告了不同大小的问题实例,并分析了数据所属范围与计算时间之间的依存关系。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号