Abstract
The allocation of tools to machines determines potential part routes in flexible manufacturing systems. Given production requirements and a minimum feasible set of tools, the decision of how to fill vacant slots in tool magazines to maximize routing flexibility is shown to be a minimum cost network flow problem for the cases when routing flexibility is a function of the average workload per tool aggregated over tool types, or of the number of possible routes through the system. A linear programming model is then used to plan a set of routes for each part type so as to minimize either the material handling requirement or the maximum workload on any machine. The impact of these tool addition strategies on the material handling and workload equalization is investigated and computational results presented. The advantage of the overall approach is computational simplicity at each step and the ability to react to dynamic changes.
Original language | English (US) |
---|---|
Pages (from-to) | 287-310 |
Number of pages | 24 |
Journal | International Journal of Flexible Manufacturing Systems |
Volume | 6 |
Issue number | 4 |
DOIs | |
State | Published - Oct 1 1994 |
Keywords
- flexible manufacturing systems
- min cost network flow models
- routing flexibility
- tool addition
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering