Job Shop scheduling with uncertain processing time and distinct due windows

The Job Shop scheduling problem with distinct due windows is discussed. Uncertain processing time is also considered, which is denoted by triangular fuzzy number, and two fuzzy operators are introduced also. Fuzzy programming model is established for the scheduling problem. Based on the algorithm of maximizing the membership function of middle value, the fuzzy programming model is transformed into deterministic programming model and an effective genetic algorithm is presented also. A great deal of simulation results are given to illustrate the efficiency of the proposed model and the scheduling algorithm.