Abstract
The scheduling of a single server in a finite source model is considered. TheN customers in the system have different failure and repair rates. Also the costs depend on the customers which are broken down. We give a condition under which the average costs are minimized by a simple list policy, and with a counterexample we show that in the general case no optimal list policy may exist. This motivates us to derive policies which are optimal under low and high traffic conditions. They are again list policies, which behave well numerically.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blanc JPC (1993) Performance analysis and optimization with the power-series algorithm. In: Donatiello L, Nelson R (Eds) Performance Evaluation of Computer and Communication Systems 53-80. Lecture Notes in Computer Science 729, Springer-Verlag
Buyukkoc C, Varaiya P, Walrand J (1985) Thecμ rule revisited. Advances in Applied Probability 17:237–238
Chakka R, Mitrani I (1994) Heterogeneous multiprocessor systems with breakdowns: Performance and optimal repair strategies. Theoretical Computer Science 125:91–109
Courcoubetis C, Varaiya P (1984) Serving process with least thinking time maximizes resource utilization. IEEE Transactions on Automatic Control 29:1005–1008
Courcoubetis C, Varaiya P, Walrand J (1982) Invariance in resource sharing problems. In: Proceedings of the 21th IEEE Conference on Decision and Control 861–863
Hordijk A, Koole GM (1993) On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes. Advances in Applied Probability 25:979–996
Kameda H (1982) A finite-source queue with different customers. Journal of the ACM 29:478–491
Katehakis MN, Levine A (1985) A dynamic routing problem — numerical procedures for light traffic conditions. Applied Mathematics and Computation 17:267–276
Koole GM (1992) Stochastic scheduling and dynamic programming. PhD thesis, Leiden University. On request available from the author
Koole GM (1994) On the power series algorithm. In: Boxma OJ, Koole GM (Eds) Performance Evaluation of Parallel and Distributed Systems — Solution Methods. CWI, Amsterdam, CWI Tract 105 & 106
Righter R (1996) Optimal control of the finite source single server queue. Journal of Applied Probability, to appear
Serfozo RF (1979) An equivalence between continuous and discrete time Markov decision processes. Operations Research 27:616–620
Tijms HC (1986) Stochastic modelling and analysis: A computational approach. Wiley
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Koole, G., Vrijenhoek, M. Scheduling a repairman in a finite source system. Mathematical Methods of Operations Research 44, 333–344 (1996). https://doi.org/10.1007/BF01193935
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01193935