A palmer-based continuous fuzzy flexible flow-shop scheduling algorithm

摘要

Flexible flow shops can be thought of as generalizations of simple flow shops. In the past, the processing time for each job was usually assumed to be known exactly, but in many real-world applications, processing times may vary dynamically due to human factors or operating faults. In the past, we demonstrated how discrete fuzzy concepts could easily be used in the Palmer algorithm for managing uncertain flexible-flow-shop scheduling. In this paper, we generalize it to continuous fuzzy domains. We use triangular membership functions for flexible flow shops with more than two machine centers to examine processing-time uncertainties and to make scheduling more suitable for real applications. We first use the triangular fuzzy LPT algorithm to allocate jobs, and then use the triangular fuzzy Palmer algorithm to deal with sequencing the tasks. The proposed method thus provides a more flexible way of scheduling jobs than conventional scheduling methods.