首页    期刊浏览 2024年11月08日 星期五
登录注册

文章基本信息

  • 标题:Scheduling with Explorable Uncertainty
  • 作者:Christoph D{\"u}rr ; Thomas Erlebach ; Nicole Megow
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2018
  • 卷号:94
  • 页码:30:1-30:14
  • DOI:10.4230/LIPIcs.ITCS.2018.30
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We introduce a novel model for scheduling with explorable uncertainty. In this model, the processing time of a job can potentially be reduced (by an a priori unknown amount) by testing the job. Testing a job j takes one unit of time and may reduce its processing time from the given upper limit p'_j (which is the time taken to execute the job if it is not tested) to any value between 0 and p'_j. This setting is motivated e.g. by applications where a code optimizer can be run on a job before executing it. We consider the objective of minimizing the sum of completion times on a single machine. All jobs are available from the start, but the reduction in their processing times as a result of testing is unknown, making this an online problem that is amenable to competitive analysis. The need to balance the time spent on tests and the time spent on job executions adds a novel flavor to the problem. We give the first and nearly tight lower and upper bounds on the competitive ratio for deterministic and randomized algorithms. We also show that minimizing the makespan is a considerably easier problem for which we give optimal deterministic and randomized online algorithms.
  • 关键词:online scheduling; explorable uncertainty; competitive ratio; makespan; sum of completion times
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有