The loading problem in a Cellular Manufacturing System (CMS) lies in the allocation of operations and associated cutting tools to machines for a given set of parts subject to capacity constraints. This research suggested a heuristic approach to the machine loading problem under the constraints of the workload and tool magazine capacity of each machine. This approach tried to reduce the maximum workload of the machines by partially grouping them. 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. The heuristic demonstrates the efficiency of allocating operations to each group and this problem is formulated as an integer linear problem. Performance of the suggested loading heuristics is tested by means of randomly generated tests. The result of this research, which is a well-balanced workload system, is obtained and partial grouping is a critical means of obtaining that goal. Partial grouping yields a more balanced workload because it entails the subdivision of demands into several batches.
展开▼
