Solving Unrelated Parallel Machine Scheduling Problems with Fuzzy Processing Time

Abstract

In recent years, many efforts have been made towards fuzzy scheduling problems where the uncertain processing time is treated as the fuzzy number. In this paper, we deal with unrelated parallel machine scheduling problems with fuzzy processing time and propose a fuzzy scheduling algorithm to minimize makespan, which can give more than one schedule as the solution. Our emphasis is particularly on the evaluating method of the solution schedules. A method is given to evaluate the solution schedules in order to choose one schedule as the best to be executed practically.