Abstract
Re-entrant two machine flow shop scheduling problem with the objective of minimizing makespan is considered. There are n jobs to be processed on two machines and each job has the processing route (M1, M2, M1, M2, ..., M1, M2). In contrast to the classical scheduling assumption that each job visits each machine at most once, in this re-entrant shop, jobs can visit certain machines more than once. The re-entrant characteristic makes the problem much more complicated and intractable. In this paper, the re-entrant problem can be transformed into a two-machine flow shop scheduling problem subject to parallel chain precedence constraints, which is equivalent to the single machine scheduling subject to precedence delays under some conditions. Based on the relationships explored for the three scheduling problems, polynomial algorithms are developed for some special cases of the re-entrant problem.
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.
