Within the last year
Within the past 3 years
1 - 10 of 21 articles
This note studies queuing systems in which jobs are scheduled for service within generations. Mean conditional waiting times are derived for systems where the queue discipline within each generation is shortest processing time first or processor-shared round robin.
The sequential decision problem considered in this paper consists of finding an optimal policy for increasing the capacity of a multi-terminal network with requirements increasing over a planning period and arcs subject to failure. This problem is formulated as a shortest-route problem in a very...
In this paper we study sensitive discount optimality criteria for finite state and action, discrete time parameter, stationary generalized Markov decision chains. We extend previous results obtained by Miller and Veinott and Veinott for substochastic transition matrices to arbitrary non-negative...
The purpose of this note is to provide comparable results to Higa et al. (Higa, I., A. Feyerherm, A. Machado. 1975. Waiting time in an ( S − 1, S ) inventory system. Opns. Res. 23 674–680.) for the constant resupply time case. Since resupply times are seldom as variable as exponential, the...
We generalize a method for constructing facets for the convex hull of integer solutions to set packing problems to arbitrary zero-one problems having nonnegative constraint-matrices. A particular class of facets is obtained explicitly and illustrated by a numerical example.
A simple physical model of the way fire engines travel leads to the hypothesis that T , the average fire engine travel time, depends on D , the distance travelled according to T ( D ) = 2( D / a ) 1/2 if D ≦ d and T ( D ) = v c / a + D / v c if D > d . The parameter a can be interpreted as an...
This paper develops new improved bounds on the optimal return function in finite state and action, infinite horizon, discounted stationary Markov decision chains. The bounds are obtained by solving a single-constraint, bounded-variable linear program. They can be used for algorithmic termination...
Marketing managers make decisions about price, advertising, promotion, and other marketing variables on the basis of factual data, judgments, and assumptions about how the market works. BRANDAID is a flexible, on-line model for assembling these elements to describe the market and evaluate...
Standard works on queuing theory are in error in the calculation of the equilibrium delay distribution—and even of the average delay—in a single-server system with batch input, when the batches are not of constant size. This paper corrects the error, which occurs in connection with that...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.