| Article ID: | iaor2007803 |
| Country: | United Kingdom |
| Volume: | 38 |
| Issue: | 5 |
| Start Page Number: | 577 |
| End Page Number: | 592 |
| Publication Date: | Jul 2006 |
| Journal: | Engineering Optimization |
| Authors: | Pan Jason Chao-Hsien, Chen Jen-Shiang |
| Keywords: | scheduling, programming: integer |
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.