IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v50y2002i1p197-216.html
   My bibliography  Save this article

Analysis, Design, and Control of Queueing Systems

Author

Listed:
  • Shaler Stidham

    (Department of Operations Research, CB #3180, Smith Building, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27599-3180)

Abstract

No abstract is available for this item.

Suggested Citation

  • Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    • Handle: RePEc:inm:oropre:v:50:y:2002:i:1:p:197-216
    DOI: 10.1287/opre.50.1.197.17783
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.1.197.17783
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.50.1.197.17783?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Richard F. Serfozo, 1979. "Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes," Operations Research, INFORMS, vol. 27(3), pages 616-620, June.
    2. Harvey M. Wagner, 2002. "And Then There Were None," Operations Research, INFORMS, vol. 50(1), pages 217-226, February.
    3. Martin Eisenberg, 1972. "Queues with Periodic Service and Changeover Time," Operations Research, INFORMS, vol. 20(2), pages 440-451, April.
    4. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    5. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, August.
    6. John D. C. Little, 1961. "A Proof for the Queuing Formula: L = (lambda) W," Operations Research, INFORMS, vol. 9(3), pages 383-387, June.
    7. J. George Shanthikumar & David D. Yao, 1992. "Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control," Operations Research, INFORMS, vol. 40(3-supplem), pages 293-299, June.
    8. Richard E. Nance & Robert G. Sargent, 2002. "Perspectives on the Evolution of Simulation," Operations Research, INFORMS, vol. 50(1), pages 161-172, February.
    9. Jim Jackson, 2002. "How Networks of Queues Came About," Operations Research, INFORMS, vol. 50(1), pages 112-113, February.
    10. M. Dacre & K. Glazebrook & J. Niño‐Mora, 1999. "The achievable region approach to the optimal control of stochastic systems," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 61(4), pages 747-791.
    11. Steven A. Lippman & Shaler Stidham, 1977. "Individual versus Social Optimization in Exponential Congestion Systems," Operations Research, INFORMS, vol. 25(2), pages 233-247, April.
    12. Hong Chen & Avi Mandelbaum, 1991. "Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations," Mathematics of Operations Research, INFORMS, vol. 16(2), pages 408-446, May.
    13. Shaler Stidham, 1970. "On the Optimality of Single-Server Queuing Systems," Operations Research, INFORMS, vol. 18(4), pages 708-732, August.
    14. A. Federgruen & H. Groenevelt, 1988. "Characterization and Optimization of Achievable Performance in General Queueing Systems," Operations Research, INFORMS, vol. 36(5), pages 733-741, October.
    15. Martin I. Reiman, 1984. "Open Queueing Networks in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 441-458, August.
    16. B. Avi-Itzhak & W. L. Maxwell & L. W. Miller, 1965. "Queuing with Alternating Priorities," Operations Research, INFORMS, vol. 13(2), pages 306-318, April.
    17. E. G. Coffman & I. Mitrani, 1980. "A Characterization of Waiting Time Performance Realizable by Single-Server Queues," Operations Research, INFORMS, vol. 28(3-part-ii), pages 810-821, June.
    18. Lawrence M. Wein, 1990. "Optimal Control of a Two-Station Brownian Network," Mathematics of Operations Research, INFORMS, vol. 15(2), pages 215-242, May.
    19. K.D. Glazebrook & R. Garbe, 1999. "Almost optimal policies for stochastic systemswhich almost satisfy conservation laws," Annals of Operations Research, Springer, vol. 92(0), pages 19-43, January.
    20. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    21. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    22. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    23. Stuart Dreyfus, 2002. "Richard Bellman on the Birth of Dynamic Programming," Operations Research, INFORMS, vol. 50(1), pages 48-51, February.
    24. Peter Whittle, 2002. "Applied Probability in Great Britain," Operations Research, INFORMS, vol. 50(1), pages 227-239, February.
    25. Mark E. Crovella & Murad S. Taqqu, 1999. "Estimating the Heavy Tail Index from Scaling Properties," Methodology and Computing in Applied Probability, Springer, vol. 1(1), pages 55-79, July.
    26. Ronald A. Howard, 2002. "Comments on the Origin and Application of Markov Decision Processes," Operations Research, INFORMS, vol. 50(1), pages 100-102, February.
    27. Dimitris Bertsimas & José Niño-Mora, 1996. "Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems," Mathematics of Operations Research, INFORMS, vol. 21(2), pages 257-306, May.
    28. Knudsen, Niels Chr, 1972. "Individual and Social Optimization in a Multiserver Queue with a General Cost-Benefit Structure," Econometrica, Econometric Society, vol. 40(3), pages 515-528, May.
    29. Winfried K. Grassmann & Michael I. Taksar & Daniel P. Heyman, 1985. "Regenerative Analysis and Steady State Distributions for Markov Chains," Operations Research, INFORMS, vol. 33(5), pages 1107-1116, October.
    30. Colin E. Bell, 1971. "Characterization and Computation of Optimal Policies for Operating an M / G /1 Queuing System with Removable Server," Operations Research, INFORMS, vol. 19(1), pages 208-218, February.
    31. William P. Peterson, 1991. "A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 90-118, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    2. José Niño-Mora, 2000. "On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices," Economics Working Papers 456, Department of Economics and Business, Universitat Pompeu Fabra.
    3. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case," Economics Working Papers 302, Department of Economics and Business, Universitat Pompeu Fabra, revised Jul 1998.
    4. Dimitris Bertsimas & Velibor V. Mišić, 2016. "Decomposable Markov Decision Processes: A Fluid Optimization Approach," Operations Research, INFORMS, vol. 64(6), pages 1537-1555, December.
    5. Ick-Hyun Nam, 2001. "Dynamic Scheduling for a Flexible Processing Network," Operations Research, INFORMS, vol. 49(2), pages 305-315, April.
    6. Kevin D. Glazebrook & José Niño-Mora, 2001. "Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance," Operations Research, INFORMS, vol. 49(4), pages 609-623, August.
    7. Esther Frostig & Gideon Weiss, 2016. "Four proofs of Gittins’ multiarmed bandit theorem," Annals of Operations Research, Springer, vol. 241(1), pages 127-165, June.
    8. Tianhu Deng & Ying‐Ju Chen & Zuo‐Jun Max Shen, 2015. "Optimal pricing and scheduling control of product shipping," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(3), pages 215-227, April.
    9. Dimitris Bertsimas & José Niño-Mora, 2000. "Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic," Operations Research, INFORMS, vol. 48(1), pages 80-90, February.
    10. Kyle Y. Lin & Sheldon M. Ross, 2003. "Admission Control with Incomplete Information of a Queueing System," Operations Research, INFORMS, vol. 51(4), pages 645-654, August.
    11. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    12. Ward Whitt & Wei You, 2020. "Heavy-traffic limits for stationary network flows," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 53-68, June.
    13. Tingliang Huang & Gad Allon & Achal Bassamboo, 2013. "Bounded Rationality in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 263-279, May.
    14. Santiago R. Balseiro & Ozan Candogan, 2017. "Optimal Contracts for Intermediaries in Online Advertising," Operations Research, INFORMS, vol. 65(4), pages 878-896, August.
    15. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
    16. Knight, Vincent A. & Harper, Paul R., 2013. "Selfish routing in public services," European Journal of Operational Research, Elsevier, vol. 230(1), pages 122-132.
    17. Zhou, Wenhui & Lian, Zhaotong & Wu, Jinbiao, 2014. "When should service firms provide free experience service?," European Journal of Operational Research, Elsevier, vol. 234(3), pages 830-838.
    18. Li, Xin & Chen, Hsing Hung & Tao, Xiangnan, 2016. "Pricing and capacity allocation in renewable energy," Applied Energy, Elsevier, vol. 179(C), pages 1097-1105.
    19. Bertsimas, Dimitris. & Niño-Mora, Jose., 1994. "Restless bandit, linear programming relaxations and a primal-dual heuristic," Working papers 3727-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    20. Bitran, Gabriel R. & Morabito, Reinaldo., 1994. "Open queueing networks : optimization and performance evaluation models for discrete manufacturing systems," Working papers 3743-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    More about this item

    Keywords

    Professional; comments on;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:50:y:2002:i:1:p:197-216. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.