Abstract
Known approximation algorithms recommended for the permutation flow-shop problem with the weighted sum of completion times have a worst-case performance ratio which is unknown, or known but unlimited. We propose new algorithms with this ratio equal to [ m k]ϱ k , where ϱ k is the worst-case performance ratio of an algorithm which solves an auxiliary k -machine problem. Worst-case analyses of other approximation algorithms for the mean completion time and the makespan criteria are also presented.
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.
