A Heuristic Algorithm for $n/m/D/F/F_{max}$

Flow Shop에서 준비시간이 작업순서에 종속적인 경우의 휴리스틱 알고리듬의 개발

This paper is to develop four heuristic algorithms for $n/m/D/F/F_{max}$. A study present numerical example for (H1) algorithm. Among the sequence generated, the best sequence is J2, J1, J6, J7, J4, J3, J5 and makespan is 528. The optimal makespan of this numerical example can be found as 528 as also, and the worst value of heuristic solution is only 7.2 % away from it.