Abstract
A multiobjective scheduling method for generating the approximate set of nondominated solutions to a flowshop scheduling problem with three objectives (to minimize makespan, mean flowtime and total waiting time in buffer) is proposed on the basis of the random sample scheduling method for solving a single objective scheduling problem. A required number of random samples for generating this nondominated set is derived through modifying and developing the above random sample scheduling method. Some numerical examples are shown to perform the effectiveness of the proposed method by means of the new scale named "a degree of point approximation for each nondominated solution."
