Abstract
It is studied that several constructive heuristics for solving the sequence dependent setup time flowshop problem with the objective of minimizing makespan. Three priority rules imbedded in the heuristics are tested and a tie-breaking strategy is examined. The experimental results on benchmarks show that the priority rules are helpful to improve the performance, especially for the instances in which setup times are averagely smaller than the average processing time. The results also show that the setup times have a large effect on the performance of the heuristics.
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.
