Abstract
A multiobjective scheduling method using complex random sampling (CRSS) proposed in part I can be applied to various kinds of multiobjective scheduling. The effectiveness of this method has been shown only in single-machine bicriterion scheduling problems where another effective method exists to find a set of nondominated schedules. It is hard to show the method is effective for any other multiobjective scheduling problems in general. This paper applies this method to a three-objective, 2-machine, flow-shop scheduling problem for making it clear through experimental simulations that the method efficiently generates an approximate set of nondominated schedules with high accuracy in this case.
