Abstract
We consider the problem of two-machine flow-shop scheduling with a single server and unit server times, we show that this problem is NP -hard in the strong sense and present a simple greedy algorithm for it with worst-case bound $\frac{3}{2}$.
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.
