In this thesis, we develop integer programming models which find the optimal part-machine family solutions, that disaggregate a factory process at the lowest cost. The groupings created using the methods presented in this thesis can then act as the basis for the application of Group Technology, which include machine placement, job scheduling, and part routing. Four exact 0−1 Linear Programming techniques are developed and presented. The first 0 − 1 Linear Programming technique only focuses on part subcontracting as a means to disaggregate, and the second only focuses on machine duplication to disaggregate. The final two methods both yield part-machine family disaggregation through simultaneous part subcontracting and machine duplication. Once these methods are applied to example problems, the results provide the exact solutions, which have not been found in previous work. / NSERC Discovery Grant
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OGU.10214/6674 |
| Date | 10 May 2013 |
| Creators | Mason, Cynthia |
| Contributors | Vannelli, A. |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.0021 seconds