International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3
371 Modeling of Tool Switching Problem in a Flexible Manufacturing Cell: with two or More Machines
Download citation file:
- Ris (Zotero)
- Reference Manager
The importance of tool management for the efficient use of automated manufacturing systems has been stressed by several authors since end of 80s. The central goal of tool management, in particular, for flexible machines is to decide how to sequence the parts to be produced, and what tools to allocate to the machine, in order to minimize the number of tool setups. This article, in spite of prior works that all of them had been only on one machine, study this problem on M- machine (), simultaneously, in a flexible manufacturing cell. At this study, we suppose that all of the machines have same working competencies but have different magazine capacities. There are N different jobs and L-tools that each of the jobs just needs one processing operation and a given set of tools so that each processing work can be operate by each machine. Tool switching problem is strongly NP-Complete, but there are some heuristic and meta-heuristic approaches to solve it. In this study, we present a MINLP mathematical model in general form for this new version of tool switching problem and solve by Lingo 11.0 and present computational results for instances of this issue. In the future works we will try to solve this model by metaheuristic algorithms (GA), and consider more assumptions in modeling the problem.