arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.07070cs.DS
收藏

多处理机调度问题的分枝定界算法分析

Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem

Thomas Lively, William Long, Artidoro Pagnoni

摘要:

多处理机调度问题(MSP)是一个NP完全问题,在计算机和操作系统中有着重要的应用。我们提供了一个调查的多项式时间近似,启发式和元启发式算法,存在解决MSP。我们还实现了藤田的国家的最先进的分支定界算法,并评估使用藤田的二叉搜索定界方法,而不是费尔南德斯界的好处。我们发现,实际上藤田的方法并没有提供任何改进的费尔南德斯约束我们的数据集。

英文摘要:

The Multiprocessor Scheduling Problem (MSP) is an NP-Complete problem with significant applications in computer and operations systems. We provide a survey of the wide array of polynomial-time approximation, heuristic, and meta-heuristic based algorithms that exist for solving MSP. We also implement Fujita's state-of-the-art Branch-and-Bound algorithm and evaluate the benefit of using Fujita's binary search bounding method instead of the Fernandez bound. We find that in fact Fujita's method does not offer any improvement over the Fernandez bound on our data set.

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

↑