• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of the Chinese Institute of Industrial Engineers >Single-machine scheduling with decreasing time-dependent processing times to minimize total absolute differences in waiting times * (* wuyubin79@163.com) View all notes
【24h】

Single-machine scheduling with decreasing time-dependent processing times to minimize total absolute differences in waiting times * (* wuyubin79@163.com) View all notes

机译：单机调度，减少了与时间有关的处理时间，以最大程度地减少等待时间中的绝对绝对差异*（* wuyubin79@163.com）查看所有注释

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this article we consider a single-machine scheduling problem with decreasing time-dependent job-processing times. Decreasing time-dependent job-processing times means that its processing time is a non-increasing function of its execution start time. The objective is to find a schedule that minimizes total absolute differences in waiting times. We show that the optimal schedule is V-shaped: jobs are arranged in the descending order of their normal processing times if they are placed before the job with the smallest normal processing time, but in the ascending order of their normal processing times if placed after it. We prove several other properties of an optimal schedule, and introduce two heuristic algorithms that are tested against a lower bound. We also provide computational results to evaluate the performance of the heuristic algorithms. V : View full textDownload full textKeywordsscheduling, single-machine, time-dependent processing times, total absolute differences in waiting timesKeywords Related var addthis_config = { ui_cobrand: "Taylor & Francis Online", services_compact: "citeulike,netvibes,twitter,technorati,delicious,linkedin,facebook,stumbleupon,digg,google,more", pubid: "ra-4dff56cd6bb1830b" }; Add to shortlist Link Permalink http://dx.doi.org/10.1080/10170669.2012.721211
机译：在本文中，我们考虑了一个单机调度问题，该问题减少了与时间有关的作业处理时间。减少与时间相关的作业处理时间意味着它的处理时间与其执行开始时间无关。目的是找到一个时间表，以最大程度地减少等待时间中的绝对绝对差异。我们显示最佳计划是V形的：如果将作业放置在具有最小正常处理时间的作业之前，则以其正常处理时间的降序排列，但是如果放置在作业之后，则以其正常处理时间的升序排列。它。我们证明了最佳计划的其他几个属性，并介绍了两种针对下限进行测试的启发式算法。我们还提供了计算结果，以评估启发式算法的性能。 V：查看全文下载全文关键字排程，单机处理，与时间有关的处理时间，等待时间的总绝对差关键字相关的关键字var addthis_config = {ui_cobrand：“泰勒和弗朗西斯在线”，servicescompact：“ citeulike，netvibes，twitter，technorati，delicious ，linkedin，facebook，stumbleupon，digg，google，更多”，发布号：“ ra-4dff56cd6bb1830b”};添加到候选列表链接永久链接http://dx.doi.org/10.1080/10170669.2012.721211

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号