Flow-shop scheduling problem with imprecise processing times based on distance ranking of fuzzy numbers

摘要

This study examines the flow-shop scheduling problem with imprecise job processing times, which could be occurred in some real-world applications. The uncertain situation is that the precise values of job processing time are frequently unknown in advance. We could then use the fuzzy numbers to represent the imprecise job processing values. Triangular fuzzy numbers and a distance ranking method are thus used to deal with fuzzy job processing times and to define fuzzy ordering as well. The main concern of this study is that the proposed fuzzy approach is useful to solve some real-world flow-shop applications with imprecise job processing times.