Abstract
The classical k-server problem has been widely used to model two-level memory systems (e.g., paging and caching). The problem is to plan the movements of k mobile servers on the vertices of a graph under an on-line sequence of requests. We generalize this model in order to process a sequence of bulk requests and formulate, in this way, a valid model for the usual two-level tooling configuration in automated production systems. A slight adaptation of the so-called Partitioning Algorithm provides an on-line algorithm for this more general case, preserving basically the same competitive properties as the classical model. This approach yields a new tool management procedure in manufacturing which outperforms in its quality the usual methods that are based on heuristics for the traveling salesman problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L.A. Belady, A study of replacement algorithms for virtual storage computers, IBM System Journal 5(2) (1966) 78–101.
J. Blazewicz and G. Finke, Scheduling with resource management in manufacturing systems, European Journal of Operational Research 76 (1994) 1–14.
M. Chrobak, H. Karloff, T. Payne and S. Vishwanathan, New results on server problems, SIAM Journal on Discrete Mathematics 4(2) (1991) 172–181.
E. Coffman and P. Denning, Operating Systems Theory(Prentice Hall, Englewood Cliffs, NJ, 1973).
Y. Crama, A.W.J. Kolen, A.G. Oerlemans and T.C.R. Spieksma, Minimizing the number of tool switches on a flexible machine, International Journal of Flexible Manufacturing Systems 6(1) (1994) 33–54.
A. Fiat, R.M. Karp, M. Luby, L.A. McGeogh, D.D. Sleator and N.E. Young, Competitive paging algorithms, Journal of Algorithms 12 (1991) 685–699.
B. Golden and W. Steward, Empirical analysis of heuristics, in: The Traveling Salesman Problem, eds. E.L. Lawler et al. (Wiley, 1985) pp. 207–249.
M.S. Manasse, L.A. McGeogh and D.D. Sleator, Competitive algorithms for server problems, Journal of Algorithms 11(2) (1990) 208–230.
R. Mattson, J. Gecsei, D.R. Slutz and I.L. Traiger, Evaluation techniques for storage hierarchies, IBM System Journal 2 (1970) 78–117.
L. McGeogh and D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica 6 (1991) 816–825.
C. Privault, Mod`eles math´ematiques pour la gestion off-line et on-line des changements d'outils sur une machine flexible, Ph.D. thesis, Universit´e Joseph Fourier, Grenoble (1994).
C. Privault and G. Finke, Tool management on NC-machines, in: Proc. International Conference on Industrial Engineering and Production Management IEPM'93, Mons (1993) pp. 667–676.
C. Privault and G. Finke, Modelling a tool switching problem on a single NC-machine, Journal of Intelligent Manufacturing 6 (1995) 87–94.
J. Spirn, Program Behavior: Models and Measurements(Elsevier, New York, 1977).
C.S. Tang and E.V. Denardo, Models arising from a flexible manufacturing machine, part 1: Minimization of the number of tool switches, Operations Research 36(5) (1988) 767–777.
Rights and permissions
About this article
Cite this article
Privault, C., Finke, G. k-server problems with bulk requests: an application to tool switching in manufacturing. Annals of Operations Research 96, 255–269 (2000). https://doi.org/10.1023/A:1018939132489
Issue Date:
DOI: https://doi.org/10.1023/A:1018939132489