.png){kind=icon}
.png){kind=icon}
Return
The modular tool switching problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.09.052.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article analyzes the complexity of the modular tool switching problem arising in flexible manufacturing environments. A single, numerically controlled placement machine is equipped with an online tool magazine consisting of several changeable tool feeder modules. The modules can hold a number of tools necessary for the jobs. In addition to the online modules, there is a set of offline modules which can be changed to the machine during a job change. A number of jobs are processed by the machine, each job requiring a certain set of tools. Tools between jobs can be switched individually, or by replacing a whole module containing multiple tools. or a whole module, containing multiple tools can be replaced. We consider the complexity of the problem of arranging tools into the modules, so that the work for module and tool loading is minimized. Tools are of uniform size and have unit loading costs. We show that the general problem is NP-hard, and in the case of fixed number of modules and fixed module capacity the problem is solvable in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Complexity theory
Flexible Manufacturing Systems
Tool loading
Set-up optimization
Printed circuit board
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W