Abstract
In the hybrid flow shop, jobs are subjected to process through stages in series as in the classical flow shop, while each stage contains one or more identical machines. This paper mainly studies the scheduling problem in the two-stage hybrid flow shop, namely the proportionate scheduling. In such problem, it is assumed that each job has the same processing time in different stages. The objective of minimizing the makespan is considered. If there are two machines in the first stage and m machines in the second, then an approximation algorithm with worst case ratio no more than 3/2 is provided. If each stage consists of only two machines, we show that the tight bound of our algorithm can be reduced to 4/3.
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.
