Shaler Stidham

Learn More
We formulate and analyze a Markov decision process (dynamic programming) model for airline seat allocation (yield management) on a single-leg flight with multiple fare classes. Unlike previous models, we allow cancellation, no-shows, and overbooking. Additionally, we make no assumptions on the arrival patterns for the various fare classes. Our model is also(More)
As the reader will quickly discover, this article is a survey—from my personal perspective—of fifty years of research on the analysis, design, and control of queues. My choice of topics is far from exhaustive; I have focused on those research achievements that I believe have been the most significant in their contributions to queueing theory and to its(More)
We consider a discrete-time Markov decision process with a partially ordered state space and two feasible control actions in each state. Our goal is to nd general conditions, which are satissed in a broad class of applications to control of queues, under which an optimal control policy is monotonic. An advantage of our approach is that it easily extends to(More)
A network of queues can serve as a useful model for systems arising in many contexts, including manufacturing, distributed computer systems, voice and data communicat ions, and vehicular traffic flow. Descriptive models can help to evaluate and predict the performance of existing and proposed systems, and thus improve the design of a system. Control models(More)
We consider several models for a generalized vacation or polling system with a general (in particular, non-Poisson) arrival process. Our results are given in the context of an in put-output process operating over successive cycles", in which the service mechanism can be in an up" mode (processing) or down" mode (e.g., vacation, walking). Our primary mo(More)