Abstract
Consider a production system that consists ofm machines each of which can produce parts ofn types. When machinek is used, it produces a part of typei with probabilityp ki . Requests arrive for parts, one at a time. With probability λ i an arriving request is for a part of typei. The requests must be served without waiting. Thus, if a requested part is not available, it must be produced. We find necessary and sufficient conditions for the existence of a strategy (a choice of the machines to be used) which makes the inventory of parts stable and we provide such a strategy.
Two variations of this model are also considered: the case of batch arrivals of requests, and that of a system where the requests can be queued.
Similar content being viewed by others
References
S. Asmussen,Applied Probability and Queues (J. Wiley, 1987).
C. Courcoubetis and R. Weber, Necessary and sufficient conditions for stability of a bin-packing system, J. Appl. Prob. 23 (1986) 989–999.
B. Hajek, Hitting-time and occupation-time bounds implied by drift analysis with applications, Adv. Appl. Prob. 14 (1986) 502–525.
R. Tweedie, Sufficient conditions for ergodicity and recurrence of Markov chains on a general state space, Stoch. Proc. and Appl. 3 (1975) 385–403.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Courcoubetis, C., Konstantopoulos, P., Walrand, J. et al. Stabilizing an uncertain production system. Queueing Syst 5, 37–54 (1989). https://doi.org/10.1007/BF01149185
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01149185