1995 年 13 巻 4 号 p. 562-566
The development of a scheduling system which used the geometric model was described and its processing alogorithm was shown in the previous paper. The system utilizes the Coded Boundary Representation (CBR) method which has been developed as the geometric model. The scheduling problem is reduced to a 2 dimensional box-packing problem by using this geometric model.
In this paper, the proposed method is applied to the simple scheduling problems which can be processed by ordinary methods. The comparison is made on the scheduling ability of this method with ordinary methods, i.e., PERT and the load balancing method. The proposed method is also applied successfully to the other problem which ordinary methods can not treat with ease. It is shown that this method is very useful and flexible for the general and special problem as the result.