Abstract
A re-entrant shop describes a manufacturing environment in which a machine can process a job more than once. A re-entrant shop can be classified into a re-entrant job-shop (RJS) and a re-entrant flow-shop (RFS). This article presents the development of the mixed binary integer programming (BIP) technique for the RJS and the RFS scheduling problems. Eight mixed BIP models are proposed for solving re-entrant shop scheduling problems to minimize makespan. The models RJS-1, RJS-2, RJS-3, and RJS-4 are for the RJS problems, while the other four models (RFS-1, RFS-2, RFS-3, and RFS-4) are for the RFS problems. Computational results show that the RJS-4 model is the best of the RJS models, and the RFS-3 model is the best of the RFS models.
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.
