For a system of finite queues, we study how servers should be assigned dynamically to stations in order to obtain optimal (or near-optimal) long-run average throughput. We assume that travel times between different service facilities are negligible, that each server can work on only one job at a time, and that several servers can work together on one job. We show that when the service rates depend only on either the server or the station (and not both), then all nonidling server assignment policies are optimal. Moreover, for a Markovian system with two stations in tandem and two servers, we show that the optimal policy assigns one server to each station unless that station is blocked or starved (in which case the server helps at the other station), and we specify the criterion used for assigning servers to stations. Finally, we propose a simple server assignment policy for tandem systems in which the number of stations equals the number of servers, and we present numerical results that show that our policy appears to yield near-optimal throughput under general conditions.Markov Decision Processes, Markovian Queueing Systems, Tandem Queues, Finite Buffers, Mobile and Cooperating Servers, Preemptive Service, Manufacturing Blocking
This paper is concerned with the design of dynamic server assignment policies that maximize the capacity of queueing networks with flexible servers. Flexibility here means that each server may be capable of performing service at several different classes in the network. We assume that the interarrival times and the service times are independent and identically distributed, and that routing is probabilistic. We also allow for server switching times, which we assume to be independent and identically distributed. We deduce the value of a tight upper bound on the achievable capacity by equating the capacity of the queueing network model with that of a limiting deterministic fluid model. The maximal capacity of the deterministic model is given by the solution to a linear programming problem that also provides optimal allocations of servers to classes. We construct particular server assignment policies, called generalized round-robin policies, that guarantee that the capacity of the queueing network will be arbitrarily close to the computed upper bound. The performance of such policies is studied using numerical examples.
We consider a single-server queue with renewal arrivals and i.i.d. service times in which the server uses the shortest remaining processing time policy. To describe the evolution of this queue, we use a measure-valued process that keeps track of the residual service times of all buffered jobs. We propose a fluid model (or formal law of large numbers approximation) for this system and, under mild assumptions, prove the existence and uniqueness of fluid model solutions. Furthermore, we prove a scaling limit theorem that justifies the fluid model as a first-order approximation of the stochastic model. The state descriptor of the fluid model is a measure-valued function whose dynamics are governed by certain inequalities in conjunction with the standard workload equation. In particular, these dynamics determine the evolution of the left edge (infimum) of the state descriptor's support, which yields conclusions about response times. We characterize the evolution of this left edge as an inverse functional of the initial condition, arrival rate, and service time distribution. This characterization reveals the manner in which the growth rate of the left edge depends on the service time distribution. By considering varying examples, the authors show that the rate can vary from logarithmic to polynomial.
In this paper, we discuss the dynamic server control in a two-class service system with abandonments. Two models are considered. In the first case, rewards are received upon service completion, and there are no abandonment costs (other than the lost opportunity to gain rewards). In the second, holding costs per customer per unit time are accrued, and each abandonment involves a fixed cost. Both cases are considered under the discounted or average reward/cost criterion. These are extensions of the classic scheduling question (without abandonments) where it is well known that simple priority rules hold.The contributions in this paper are twofold. First, we show that the classic c-μ rule does not hold in general. An added condition on the ordering of the abandonment rates is sufficient to recover the priority rule. Counterexamples show that this condition is not necessary, but when it is violated, significant loss can occur. In the reward case, we show that the decision involves an intuitive tradeoff between getting more rewards and avoiding idling. Secondly, we note that traditional solution techniques are not directly applicable. Since customers may leave in between services, an interchange argument cannot be applied. Since the abandonment rates are unbounded we cannot apply uniformization-and thus cannot use the usual discrete-time Markov decision process techniques. After formulating the problem as a continuous-time Syst (2011) 67: 63-90 Markov decision process (CTMDP), we use sample path arguments in the reward case and a savvy use of truncation in the holding cost case to yield the results. As far as we know, this is the first time that either have been used in conjunction with the CTMDP to show structure in a queueing control problem. The insights made in each model are supported by a detailed numerical study.
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival and service times are independent and identically distributed, that routing is probabilistic, and that the failure state of the system can be described by a Markov process that is independent of the other system dynamics. We find that the maximal capacity is tightly bounded by the solution of a linear programming problem and that the solution of this problem can be used to construct timed, generalized round-robin policies that approach the maximal capacity arbitrarily closely. We then give a series of structural results for our policies, including identifying when server flexibility can completely compensate for failures and when the implementation of our policies can be simplified. We conclude with a numerical example that illustrates some of the developed insights.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.