To acquire an operation system for reducing (preferably minimizing) reloading cost and a scheduler for cost and a previous process or post process at a high speed when an initial state and a target state in which a plurality of items are loaded are given.
A transition path from an initial state to a target state of a plurality of items loadable under a prescribed condition retrieved by a computer includes the steps of: generating a state space graph by connecting states that can respectively be transited from the first state to the target state by one operation with an edge; evaluating the lower limit of operation cost from a certain state to the target state on the basis of a loading order of the plurality of items in the certain state, and a loading order of the plurality of items in the target state; and retrieving a path for minimizing operation cost from the initial state to the target state on the state space graph on the basis of the lower limit by a heuristic retrieval algorithm.
HAMA TOSHIYUKI
YANAGISAWA HIROKI
Tasaichi Tanae
Yoshihiro City