Abstract
This paper considers minimizing total completion time in a two-stage flowshop scheduling problem with m identical parallel machines at Stage 1 and a batch processor at Stage 2. We prove that the problem when all jobs have same processing time at Stage 2 is NP – hard and gave a two-approximation algorithm in O(n3) time. In the case that all jobs have arbitrary processing time at Stage 1 and at Stage 2, we give an approximation algorithm after pointing out that in this case the problem is strongly NP – hard. Hundreds of instances of a numerical experiment show that the worst-case ratio of this approximation algorithm is nearing 2.
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.
