The problem addressed in this paper is a tool switching problem on a single numerically controlled machine. In the first part, the sequence of jobs is given and the tooling aspect is dealt with: the uniform case where all switching times are equal is described, and a model for the general nonuniform case is proposed. This problem is reduced to the problem of finding a minimum cost flow of maximum value in an acyclic network. The second part is devoted to the tool management scheduling problem. Some heuristics are presented and computational results are given and analyzed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bard, J. F. (1988) A heuristic for minimizing the number of tool switches on a flexible machine. IIE Transactions, 20(4), 382–391.
Bertossi, A. A. (1981) The edge Hamiltonian path is NP-complete. Information Processing Letters, 13(4, 5), 157–159.
Blazewicz, J., Finke, G., Haupt, R. and Schmidt, G. (1988) New trends in machine scheduling. European Journal of Operational Research, 37, 303–317.
Chrobak, M., Karloff, H., Payne, T. and Vishwanathan, S. (1991) New results on server problems. SIAM Journal on Discrete Mathematics, 4(2), 172–181.
Crama, Y., Kolen, A. W. J., Oerlemans, A. G. and Spieksma, T. C. R (1991) Minimizing the number of tool switches on a flexible machine, Research Memorandum 91.010, Limburg University.
Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D. and Young, N. E. (1991) Competitive paging algorithms. Journal of Algorithms, 12, 685–699.
Golden, B. L and Stewart, W. R. (1985) Empirical analysis of heuristics, in The Traveling Salesman Problem, Lawler, E. L. et al. (eds), John Wiley & Sons, Chichester, pp. 207–249.
Kiran, A. S. and Krason, R. J. (1988) Automated tooling in a flexible manufacturing system. Industrial Engineering, April, 52–57.
Kusiak, A. (1990) Intelligent Manufacturing Systems, International Series in Industrial and Systems Engineering, Prentice Hall, New Jersey, pp. 35–45.
Kusiak, A. and Finke, G. (1987) Modeling and solving the flexible forging module scheduling problem. Engineering Optimization, 12, 1–12.
Mattson, R., Gecsei, J., Slut, D. and Traiger, I. (1970) Evaluation techniques for storage hierarchies. IBM System Journal, 2, 78–117.
McGeoch, L. A. and Sleator, D. (1989) A strongly competitive randomized paging algorithm, Carnegie Mellon University, Computer Science technical report, CMU-CS-89-122.
Oerlemans, A. G. (1992) Production planning for flexible manufacturing systems, Ph.D. Thesis, University of Limburg, Maastricht.
Privault, C. (1994), Modèles mathématiques pour la gestion off-line et on-line des changements d'outils sur une machine flexible, Thèse de Doctorat, Université Joseph Fourier, Grenoble.
Privault, C. and Finke, G. (1993) Gestion on-line des changements d'outils sur une machine flexible, in Actes du Colloque ‘Aide à la Décision et Recherche Opérationnelle’, Congrès AFCET '93, Versailles, 1, pp. 175–184.
Tang, C. S. and Denardo, E. V. (1988) Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches. Operations Research, 36(5), 767–777.
Tarjan, R. E. (1983) Data structures and network algorithms. BMS-NSF Regional Conference Series in Applied Mathematics, 44, 109–111.
Widmer, M. (1991) Job shop scheduling with tooling constraints: a tabu search approach. Journal of the Operational Research Society, 42(1), 75–82.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Privault, C., Finke, G. Modelling a tool switching problem on a single NC-machine. J Intell Manuf 6, 87–94 (1995). https://doi.org/10.1007/BF00123680
Issue Date:
DOI: https://doi.org/10.1007/BF00123680