Abstract
This paper is concerned with an investigation of the queueing process that arises in service systems with setup times and SCAN motion policy. Existing work results are extended to the case of a general distribution of setup times. A general arrivals partitioning among classes is also assumed. Some discrepancies between existing works are discussed.
Similar content being viewed by others
References
E. G. Coffman, L. A. Klimko, B. Ryan,Analysis of scanning policies for reducing disk seek times, SIAM J. Comput. (3)1 (1972), 269–279.
R. W. Conway, W. L. Maxwell L. W. Miller,Theory of scheduling (1967), Addison-Wesley Reading, Mass.
M. Eisenberg,Two queues with changeover times, Operations Res. (2)19 (1971), 386–401.
W. C. Oney,Queueing analysis of the SCAN policy for moving head disks, J. Assoc. Comput. Mach. (3)22 (1975), 397–412.
C. E. Skinner,A priority queueing system with server-walking time, Operations Res. (2)15 (1967), 278–285.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Iazeolla, G.G., Martinelli, E. Some notes on the queueing analysis of the scan policy of the walking server. Calcolo 15, 27–40 (1978). https://doi.org/10.1007/BF02576043
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02576043