论文标题
强大的单机器MakePAN调度与发布日期不确定性
Robust Single Machine Makespan Scheduling with Release Date Uncertainty
论文作者
论文摘要
本文介绍了可靠的单个机器制造计划调度，并介绍了不确定的作业日期。发布日期在知识间隔内采用值。我们在两种不同的环境中使用伽玛般的态度概念，并解决了强大和强大的遗憾标准。我们的主要结果是多项式时间算法，其运行时间（O（n log n））与非舒适情况的最佳算法。
This paper addresses the robust single machine makespan scheduling with uncertain release dates of the jobs. The release dates take values within know intervals. We use the concept of gamma-robustness in two different settings and address both the robust absolute and robust regret criteria. Our main results are polynomial time algorithms which have the same running time (O(n log n)) as the best algorithms for the non-robust case.
