The machine loading and tool allocation problem in a flexible manufacturing system
- 1 July 1987
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 25 (7) , 1081-1094
- https://doi.org/10.1080/00207548708919897
Abstract
In this paper the machine loading and tool allocation problem of an FMS is discussed, A mathematical model is developed to determine the routings of parts through the machines and to allocate appropriate cutting tools to each machine to achieve minimum overall machining cost. Computational experience with this model is presented under various system and operation parameter values. Computational refinements based on lagrangean relaxation are also discussed.Keywords
This publication has 13 references indexed in Scilit:
- The reduced cost branch and bound algorithm for mixed integer programmingComputers & Operations Research, 1985
- An ideal column algorithm for integer programs with special ordered sets of variablesMathematical Programming, 1983
- Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing SystemsManagement Science, 1983
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974