A Scheduling Method for the m-Machine n-Job Flow-Shop Problem by Gantt Chart

간트 차아트를 이용한 m-기계(機械) n-제품(製品)의 최적(最適) 흐름작업(作業) 순서결정(順序決定)

This paper is concerned with flow-shop permutation scheduling problem. This paper presents an algorithm for the minimum makespan sequence. The efficiency of proposed algorithm is demonstrated by comparisons with the existing algorithms: Johnson's, branch & bound method, and heuristic algorithms. The proposed algorithm is more effective than the other algorithms. A numerical example is given to illustrate the procedure.