توسعه يك الگوريتم ابتكاري براي حل مساله زمانبندي كارگاهي با در نظرگرفتن شرايط عدم قطعيت

In this paper, a comprehensive model is developed for job-shop scheduling problems using fuzzy methodology and concepts. Processing time are considered as fuzzy numbers, and shifting bottleneck is applied and modified as an effective heuristic in solving such problems. In developed method, a heuristic algorithm is used for optimization sub-problem. This algorithm is applied for single machine scheduling problem(1lrjl Lmax)when release time of jobs are considered and the goal is minimization of lateness. All processing times, due dates, and release times are uncertain and they are shown by fuzzy numbers. Since (1lrjl Lmax) is known as an NP-hard problem, the developed heuristic shows acceptable results. Solved numerical examples at the end of this study prove the capability of the developed heuristic in shifting bottleneck algorithm.