arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.03103cs.DM
收藏

最小化工期不确定延迟工件总重量的最小-最大遗憾调度

Min-Max Regret Scheduling To Minimize the Total Weight of Late Jobs With Interval Uncertainty

Maciej Drwal

摘要:

研究了以最小化延迟工件总重量为目标的单机排序问题。它是假设的加工时间不完全知道的时候,一个完整的调度必须被分派。相反,只给出这些参数的区间界限。与随机优化方法相比,我们考虑的问题,找到一个强大的时间表,最大限度地减少最大遗憾的解决方案。提出了一种基于混合整数线性规划的启发式算法,并通过计算实验进行了验证。

英文摘要:

We study the single machine scheduling problem with the objective to minimize the total weight of late jobs. It is assumed that the processing times of jobs are not exactly known at the time when a complete schedule must be dispatched. Instead, only interval bounds for these parameters are given. In contrast to the stochastic optimization approach, we consider the problem of finding a robust schedule, which minimizes the maximum regret of a solution. Heuristic algorithm based on mixed-integer linear programming is presented and examined through computational experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑