先行関係拘束のある順序付け問題の-解法
1974 年 40 巻 470 号 p. 233-237
詳細
1974 年 40 巻 470 号 p. 233-237
This paper gives an algorithm that converges quickly to a solution of the operational sequencing problem under any constraint of precedence relationship. And this method uses a conception called “reduction of feasible domain” in addition to the Little's algorithm. The outlines of this method are as follows.
(1) The precedence relationship is represented by matrix of which elements are denoted with 0 or 1.
(2) The complete precedence relationship is constructed by the relation between two operations (the former is precedence-matrix and the latter is incidence-matrix).
(3) All infeasible elements of the cost-matrix are forbidden by precedence-matrix.
(4) In order to effective search, the Little's motive of branching is used.
(5) Already determined partial sequences are considered as an operation and then new precedence-matrix is built up. Using them, infeasible elements of cost-matrix, newly appeared, are forbidden (“reduction of transferable domain”).
According as the repetition of process (5) and branching, it converges to a solution. Moreover, this method can be used under any constraint of precedence relationship, even if the system has no relation. As the examples of experiments, each of 13, 10, 21 operational sequencing problem is attempted and expected results are obtained.
