要素間に先行順位をもつシステムの配置問題

DOI 機関リポジトリ Web Site Web Site 被引用文献2件 参考文献7件

書誌事項

タイトル別名
  • Assignment Problem for System with Precedence Relation among Elements
  • ヨウソカン ニ センコウ ジュンイ オ モツ システム ノ ハイチ モンダイ

この論文をさがす

抄録

We think about the problem to assign the elements to an ordered sequence of stations such that the precedence relations are satisfied. At this time, we obtain the best evaluation value decided under a certain constrained condition to the assignment. This kind of problem includes the line balancing problem etc. In addition, this problem can adjust to various problems by changing constrained condition and objective function. These problems can be shown as a problem for sequential partitions of the nodes of a directed acyclic graph into subsets. We especially consider problem for finding a minimum total cost of the cut edge under the restriction of the size of block.<br>In this paper, we propose the general framework for sequential partitions of directed acyclic graphs. And we describe an efficient algorithm that can be used to reduce computational requirements and, possibly storage. We estimate that complexity of the algorithm is the polynomial order, if structure of directed acyclic graphs is near parallel.

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (7)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ