IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v134y2001i3p648-663.html
   My bibliography  Save this article

Computation of a near-optimal service policy for a single-server queue with homogeneous jobs

Author

Listed:
  • Johansen, Soren Glud
  • Larsen, Christian

Abstract

No abstract is available for this item.

Suggested Citation

  • Johansen, Soren Glud & Larsen, Christian, 2001. "Computation of a near-optimal service policy for a single-server queue with homogeneous jobs," European Journal of Operational Research, Elsevier, vol. 134(3), pages 648-663, November.
    • Handle: RePEc:eee:ejores:v:134:y:2001:i:3:p:648-663
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00290-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. Schassberger, 1975. "A Note on Optimal Service Selection in a Single Server Queue," Management Science, INFORMS, vol. 21(11), pages 1326-1331, July.
    2. Shaler Stidham & Richard R. Weber, 1989. "Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs," Operations Research, INFORMS, vol. 37(4), pages 611-625, August.
    3. Teghem, J., 1986. "Control of the service process in a queueing system," European Journal of Operational Research, Elsevier, vol. 23(2), pages 141-158, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Shih-Pin, 2007. "Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method," European Journal of Operational Research, Elsevier, vol. 177(1), pages 445-457, February.

    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. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
    2. Piotr Więcek & Eitan Altman & Arnob Ghosh, 2016. "Mean-Field Game Approach to Admission Control of an M/M/ $$\infty $$ ∞ Queue with Shared Service Cost," Dynamic Games and Applications, Springer, vol. 6(4), pages 538-566, December.
    3. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    4. Haque, Lani & Armstrong, Michael J., 2007. "A survey of the machine interference problem," European Journal of Operational Research, Elsevier, vol. 179(2), pages 469-482, June.
    5. Pengfei Guo & Refael Hassin, 2011. "Strategic Behavior and Social Optimization in Markovian Vacation Queues," Operations Research, INFORMS, vol. 59(4), pages 986-997, August.
    6. Bradley, James R., 2005. "Optimal control of a dual service rate M/M/1 production-inventory model," European Journal of Operational Research, Elsevier, vol. 161(3), pages 812-837, March.
    7. Zhang, Zhe G. & Tian, Naishuo, 2004. "An analysis of queueing systems with multi-task servers," European Journal of Operational Research, Elsevier, vol. 156(2), pages 375-389, July.
    8. Wei Li & Attahiru Sule Alfa, 2000. "Optimal policies for M/M/m queue with two different kinds of (N, T)‐policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 240-258, April.
    9. Ehud Kalai & Morton I. Kamien & Michael Rubinovitch, 1992. "Optimal Service Speeds in a Competitive Environment," Management Science, INFORMS, vol. 38(8), pages 1154-1163, August.
    10. Wallace J. Hopp & Seyed M. R. Iravani & Gigi Y. Yuen, 2007. "Operations Systems with Discretionary Task Completion," Management Science, INFORMS, vol. 53(1), pages 61-77, January.
    11. Diwas S. Kc & Christian Terwiesch, 2009. "Impact of Workload on Service Time and Patient Safety: An Econometric Analysis of Hospital Operations," Management Science, INFORMS, vol. 55(9), pages 1486-1498, September.
    12. Peter Whittle, 2002. "Applied Probability in Great Britain," Operations Research, INFORMS, vol. 50(1), pages 227-239, February.
    13. R.E. Lillo, 2001. "Optimal control of an M/G/1 queue with impatient priority customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 201-209, April.
    14. Diwas S. KC & Bradley R. Staats & Maryam Kouchaki & Francesca Gino, 2020. "Task Selection and Workload: A Focus on Completing Easy Tasks Hurts Performance," Management Science, INFORMS, vol. 66(10), pages 4397-4416, October.
    15. Jennifer M. George & J. Michael Harrison, 2001. "Dynamic Control of a Queue with Adjustable Service Rate," Operations Research, INFORMS, vol. 49(5), pages 720-731, October.
    16. Li Xia & Zhe George Zhang & Quan‐Lin Li, 2022. "A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1191-1215, March.
    17. Weng, Z. Kevin, 1996. "Manufacturing lead times, system utilization rates and lead-time-related demand," European Journal of Operational Research, Elsevier, vol. 89(2), pages 259-268, March.
    18. Jingqi Wang & Yong-Pin Zhou, 2018. "Impact of Queue Configuration on Service Time: Evidence from a Supermarket," Management Science, INFORMS, vol. 64(7), pages 3055-3075, July.
    19. Lotfi Tadj & Gautam Choudhury, 2005. "Optimal design and control of queues," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(2), pages 359-412, December.
    20. Qingqing Ye & Liwei Liu, 2017. "Performance Analysis of the GI/M/1 Queue with Single Working Vacation and Vacations," Methodology and Computing in Applied Probability, Springer, vol. 19(3), pages 685-714, September.

    More about this item

    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:eee:ejores:v:134:y:2001:i:3:p:648-663. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.