Fuzzy Multiobjective Job-Shop Scheduling

In this chapter, by considering the imprecise or fuzzy nature of the data in real-world problems, job-shop scheduling problems with fuzzy processing time and fuzzy due date are formulated. On the basis of the agreement index of fuzzy due date and fuzzy completion time, the formulated fuzzy job-shop scheduling problems are interpreted to maximize the minimum agreement index. Furthermore, multiobjective job-shop scheduling problems with fuzzy due date and fuzzy processing time are formulated as three-objective problems. Having elicited the linear membership functions reflecting the fuzzy goals of the decision maker (DM), the fuzzy decision of Bellman and Zadeh is adopted for combining them. The genetic algorithm introduced in the previous chapter is extended for solving the formulated problems.