Abstract

In this paper, the three-machine flow shop schedtlling (3FSS) with the objective of minimizing the makespan is considered. 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 3FSS. This paper analyzes a particular condition in a step of the CGPS algorithm and proposes a modification to the CGPS algorithm by changing this condition. It is shown that this modified algorithm is more general one for the 3FSS.

Full Text
Paper version not known

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 call

Disclaimer: 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.