Abstract
This paper presents a scheduling algorithm to solve flowshop problems with a common job sequence on all machines. This algorithm uses makespan as its criterion. Initially, it chooses a preferred sequence by scanning the processing times matrix and making a few calculations. The makespan time of the preferred job‐sequence is further reduced by using an improvement routine that allows interchanges between adjacent jobs. Solutions of 1200 problems are compared with the best solutions previously reported for corresponding size problems in the Campbell‐Dudek‐Smith (C‐D‐S) paper [1]. This algorithm offers up to 1% average improvement in reducing the makespan of nearly 50% of the problem sets over the results of the existing algorithms, and its computational time requirements are about one‐fifth of that of the C‐D‐S algorithm.
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.
