ABSTRACT
Scheduling mainly concerns allocating resources to jobs over time, under necessary constraints. In the past, the processing time for each job was usually assigned or estimated as a fixed value. In many real-world applications, however, the processing time for each job may vary dynamically with the situation. In this paper, fuzzy concepts are utilized in Johnson’s algorithm for managing uncertain scheduling. Given a set of jobs, each with two tasks respectively executed on two machines and their membership functions for the processing time, the fuzzy Johnson’s algorithm can get a scheduling result with a membership function for the final completion time.
