IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v98y2021i3d10.1007_s11134-021-09701-2.html
   My bibliography  Save this article

An M/PH/1 queue with workload-dependent processing speed and vacations

Author

Listed:
  • Yutaka Sakuma

    (National Defense Academy of Japan)

  • Onno Boxma

    (Eindhoven University of Technology)

  • Tuan Phung-Duc

    (University of Tsukuba
    VNU Vietnam Japan University)

Abstract

Motivated by the trade-off issue between delay performance and energy consumption in modern computer and communication systems, we consider a single-server queue with phase-type service requirements and with the following two special features: Firstly, the service speed is a piecewise constant function of the workload. Secondly, the server switches off when the system becomes empty, only to be activated again when the workload reaches a certain threshold. For this system, we obtain the steady-state workload distribution and its moments of any order. We use this result to choose the activation threshold such that a certain cost function, involving processing costs, activation costs and mean workload, is minimized.

Suggested Citation

  • Yutaka Sakuma & Onno Boxma & Tuan Phung-Duc, 2021. "An M/PH/1 queue with workload-dependent processing speed and vacations," Queueing Systems: Theory and Applications, Springer, vol. 98(3), pages 373-405, August.
    • Handle: RePEc:spr:queues:v:98:y:2021:i:3:d:10.1007_s11134-021-09701-2
    DOI: 10.1007/s11134-021-09701-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-021-09701-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-021-09701-2?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
    ---><---

    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. Silva Soares, Ana da & Latouche, Guy, 2009. "Fluid queues with level dependent evolution," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1041-1048, August.
    2. Van Houdt, Benny, 2012. "Analysis of the adaptive MMAP[K]/PH[K]/1 queue: A multi-type queue with adaptive arrivals and general impatience," European Journal of Operational Research, Elsevier, vol. 220(3), pages 695-704.
    3. J. Michael Harrison & Sidney I. Resnick, 1976. "The Stationary Distribution and First Exit Probabilities of a Storage Process with General Release Rule," Mathematics of Operations Research, INFORMS, vol. 1(4), pages 347-358, November.
    4. Mohammad Delasay & Armann Ingolfsson & Bora Kolfal, 2016. "Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service Rates," Operations Research, INFORMS, vol. 64(4), pages 867-885, August.
    5. P. H. Brill & M. J. M. Posner, 1977. "Level Crossings in Point Processes Applied to Queues: Single-Server Case," Operations Research, INFORMS, vol. 25(4), pages 662-674, August.
    6. Moeko Yajima & Tuan Phung-Duc, 2017. "Batch arrival single-server queue with variable service speed and setup time," Queueing Systems: Theory and Applications, Springer, vol. 86(3), pages 241-260, August.
    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. Ivo Adan & Brett Hathaway & Vidyadhar G. Kulkarni, 2019. "On first-come, first-served queues with two classes of impatient customers," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 113-142, February.
    2. O. Boxma & A. Löpker & D. Perry, 2016. "On a make-to-stock production/mountain modeln with hysteretic control," Annals of Operations Research, Springer, vol. 241(1), pages 53-82, June.
    3. Boxma, Onno & Frostig, Esther & Perry, David & Yosef, Rami, 2017. "A state dependent reinsurance model," Insurance: Mathematics and Economics, Elsevier, vol. 74(C), pages 170-181.
    4. O’Reilly, Małgorzata M., 2014. "Multi-stage stochastic fluid models for congestion control," European Journal of Operational Research, Elsevier, vol. 238(2), pages 514-526.
    5. Patrice Bertail & Stéphan Clémençon, 2005. "Regeneration-based Statistics for Harris Recurrent Markov Chains," Working Papers 2005-13, Center for Research in Economics and Statistics.
    6. Bertail, Patrice & Clemencon, Stephan, 2008. "Approximate regenerative-block bootstrap for Markov chains," Computational Statistics & Data Analysis, Elsevier, vol. 52(5), pages 2739-2756, January.
    7. Horváth, Gábor, 2015. "Efficient analysis of the MMAP[K]/PH[K]/1 priority queue," European Journal of Operational Research, Elsevier, vol. 246(1), pages 128-139.
    8. Hessam Bavafa & Anne Canamucio & Steven C. Marcus & Christian Terwiesch & Rachel M. Werner, 2022. "Capacity Rationing in Primary Care: Provider Availability Shocks and Channel Diversion," Management Science, INFORMS, vol. 68(4), pages 2842-2859, April.
    9. Gérard Hébuterne & Catherine Rosenberg, 1999. "Arrival and departure state distributions in the general bulk‐service queue," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 107-118, February.
    10. Pengfei Guo & Paul Zipkin, 2008. "The effects of information on a queue with balking and phase‐type service times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 406-411, August.
    11. Jiyeon Lee, 2007. "First exit times for compound Poisson dams with a general release rule," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 169-178, February.
    12. Yusei Koyama & Ayane Nakamura & Tuan Phung-Duc, 2024. "Sojourn Time Analysis of a Single-Server Queue with Single- and Batch-Service Customers," Mathematics, MDPI, vol. 12(18), pages 1-27, September.
    13. Freek Verdonck & Herwig Bruneel & Sabine Wittevrongel, 2022. "Delay analysis of a discrete-time single-server queue with an occasional extra server," Annals of Operations Research, Springer, vol. 310(2), pages 551-575, March.
    14. Wolfgang Stadje, 1998. "Level-Crossing Properties of the Risk Process," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 576-584, August.
    15. Ben A. Chaouch, 2007. "Inventory control and periodic price discounting campaigns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 94-108, February.
    16. Amir Rastpour & Armann Ingolfsson & Burhaneddin Sandıkçı, 2022. "Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1693-1710, May.
    17. Opher Baron & Antonis Economou & Athanasia Manou, 2018. "The state-dependent M / G / 1 queue with orbit," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 89-123, October.
    18. Patrice Bertail & Stéphan Clémençon, 2006. "Approximate Regenerative-block Bootstrap for Markov Chains : Some Simulation Studies," Working Papers 2006-19, Center for Research in Economics and Statistics.
    19. Mohebbi, Esmail & Hao, Daipeng, 2008. "An inventory model with non-resuming randomly interruptible lead time," International Journal of Production Economics, Elsevier, vol. 114(2), pages 755-768, August.
    20. Xu, Shuling & Hall, Nicholas G., 2021. "Fatigue, personnel scheduling and operations: Review and research opportunities," European Journal of Operational Research, Elsevier, vol. 295(3), pages 807-822.

    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:spr:queues:v:98:y:2021:i:3:d:10.1007_s11134-021-09701-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.