To assign each factory with interim products to be manufactured so as to reduce cost when the interim products manufactured in each factory are transported to another factory using one transporting facility.
A candidate assignment generator 11 generates a plurality of assignment candidates where one type of the interim products is assigned to each factory, by arbitrarily combining the factories and the interim products with each other. A transport amount calculator 12 calculates a transport amount of slabs in a case of causing one transport facility to transport the slabs in a prescribed transport path between the factories on the basis of required amount information such that an required amount of slabs that are not manufactured in the own factory in each assignment candidate is transported from another factory. A selector 13 identifies the maximum value of transport amount between factories in each assignment candidate, and selects the identified assignment candidate whose maximum value is the minimum as a solution.
| JP2003271797A | 2003-09-26 | |||
| JP2007041775A | 2007-02-15 | |||
| JPH07334576A | 1995-12-22 |
Masataka Otani
Koji Nishitani