The loading problem in a Flexible Manufacturing System (FMS) lies in the allocation of operations and associated cutting tools to machines for a given set of parts subject to capacity constraints. This dissertation proposes a hierarchical approach to the machine loading problem when the workload and tool magazine capacity of each machine are restrained. This hierarchical approach reduces the maximum workload of the machines by partially grouping them. This research deals with situations where different groups of machines performing the same operation require different processing times and this problem is formulated as an integer linear problem. This work proposes a solution that is comprised of two phases. In the first phase (Phase I), demand is divided into batches and then operations are allocated to groups of machines by using a heuristic constrained by the workload and tool magazine capacity of each group. The processing time of the operation is different for each machine group, which is composed of the same identical machines; however, these machines can perform different sets of operations if tooled differently. Each machine and each group of machines has a limited time for completing an operation. Operations are allocated to groups based on their respective workload limits. In the second phase (Phase II), demand is divided into batches again and operations are assigned to machines based on their workload and tool magazine capacity defined by Longest Processing Time (LPT) and Multifit algorithms. In Phase II, like Phase I, partial grouping is more effective in balancing the workload than total grouping. In partial grouping, each machine is tooled differently, but they can assist one another in processing each individual operation. Phase I demonstrates the efficiency of allocating operations to each group. Phase II demonstrates the efficiency of allocating operations to each machine within each group. This two-phase solution enhances routing flexibility with the same or a smaller number of machines through partial grouping rather than through total grouping. This partial grouping provides a balanced solution for problems involving a large number of machines. Performance of the suggested loading heuristics is tested by means of randomly generated tests.
| Identifer | oai:union.ndltd.org:tamu.edu/oai:repository.tamu.edu:1969.1/229 |
| Date | 30 September 2004 |
| Creators | Lee, Jong Hwan |
| Contributors | Malave, Cesar O. |
| Publisher | Texas A&M University |
| Source Sets | Texas A and M University |
| Language | en_US |
| Detected Language | English |
| Type | Book, Thesis, Electronic Dissertation, text |
| Format | 367341 bytes, 133709 bytes, electronic, application/pdf, text/plain, born digital |
Page generated in 0.0018 seconds