分枝限定法とDeep Learningを組み合わせた並列タスクスケジューリング解法の開発

DOI IR Web Site

Bibliographic Information

Other Title
  • ブンシ ゲンテイホウ ト Deep Learning オ クミアワセタ ヘイレツ タスクスケジューリングカイホウ ノ カイハツ
  • Development of A Parallel Task Scheduling Solver that Combines A Branch-and-bound Method And Deep Learning

Search this article

Abstract

type:Article

Since the task scheduling problem belongs to the strong NP-hard combinatorial optimization problem, the search time for the optimum solution becomes enormous due to the increase in the scale of the problem. Deep Learning can be applied to this difficult problem. Deep Learning has the advantage that the required time to find a solution is short once learning is completed, but it has the disadvantage that the optimum solution is not always found. Therefore, in this paper, we prototype and evaluate a method for speeding up to find the optimal solution by scheduling that combines the search method based on branch-and-bound method and deep learning.

identifier:http://repository.seikei.ac.jp/dspace/handle/10928/1431

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top