![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
The algorithm developed by Chen, Glass, Potts and Strusevich (CGPS) is by far the best one in terms of the worst-case performance ratio for the three-machine flow shop scheduling (3FSS) with minimum makespan criterion. This paper focuses on the experimental analysis of the CGPS algorithm. Three simulation experiments are conducted to compare and evaluate its performance in terms of six evaluation measures. It is shown that the CGPS algorithm is not empirically preferred for the 3FSS with minimum makespan criterion.
