Abstract
In this paper, we consider the problem of minimizing the total weighted completion time in an n-job, two-machine proportionate flow shop, where job processing times are inversely proportional to machine speeds. We show that the problem is NP-complete. We provide a tight lower bound to an optimal objective value and show that the worst-case performance ratio of the weighted shortest processing time rule is less than 2. We propose heuristic procedures to find an approximate solution for the problem. A computational study on randomly generated test problems is conducted to investigate the performance of the proposed 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.
