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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
