A heuristic algorithm for mean flowtime minimization in permutation flowshop scheduling

순열 flowshop 스케줄링에서의 평균 flowtime 최소화를 위한 경험적 알고리듬

Based on a job insertion method, we developed a heuristic algorithm for the mean flowtime objective in a permutation flowshop environment. The simulation experiments are implemented to evaluate the effectiveness of the proposed algorithm against the existing heuristics. The experiments reveal the superiority of the proposed algorithm to other heuristics especially when the ratio of the number of jobs and number of machines is greater than or equal to two.