| 摘要 |
PROBLEM TO BE SOLVED: To shorten calculation time by using the solution of the minimum cost problem of a network planning method and preparing a production schedule based on an optimum path and the value of a parameter at that time. SOLUTION: A network model where manually related manufacturing elements in manufacture elements are connected ion the from of a network is previously decided. In the network, node groups 20-25 are connected by arcs in accordance with the relation of production processes. When manufacturing relation parameters (paper product manufacturing request quantity and raw material (pulp) compound rate of paper product) are used, the total flow rate of the minimum cost flow problem of the network model is converted into a power rate and it can be displayed by a prescribed system. CPU decides the path (route of node) whose power cost of the network model becomes a minimum, obtains the value of the parameter at that time, obtains the flow rate flowing in the respective arcs at every unit time and decodes the optimum production schedule. |
