چکیده انگلیسی:
One of the important issues in the field of flexible job-shop production scheduling is reverse flows within a single production unit, as is the case in the assembly/disassembly plants. This paper studies the flexible job-shop scheduling by employing reverse flows approach, which consists of two flows of jobs at each stage in opposite directions. The problem can be used only if you have two flows: the first one going from first stage to last stage, and the second flow going from last stage to first stage. Then, a mathematical model of problem is provided to minimize the maximal completion time of the jobs (i.e., the makespan). Because of the complexity solving and proving that this problem ranked on NP-hard problems, we proposed meta-heuristic algorithm genetic (GA). Also, The parameters of these algorithm GA and their appropriate operators are obtained by the use of the Taguchi experimental design. The computational results validate outperforms proposed algorithm GA.
خبرنامه
برای ثبت نام در خبرنامه و دریافت خبرنامه ایمیل خود را وارد نمایید.