IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v17y2017i1d10.1007_s12351-015-0211-z.html
   My bibliography  Save this article

An M/E k /1 queues with emergency non-preemptive priority of a diagnostic resource

Author

Listed:
  • Jie Zhou

    (Southwest Jiaotong University
    Sichuan Normal University)

  • Jun Li

    (Southwest Jiaotong University)

Abstract

Each patient is assigned to a specific scanner in CT department of a large-size hospital. Emergency patients have non-preemptive priority access to service. The service time of each CT scanner follows an Erlang distribution by data analysis from this hospital. We develop an M/E k /1 queueing model with emergency non-preemptive priority. Firstly, the expected waiting time of the jth phase regular patient in the waiting queue is given by Laplace transform. Using this and generating function of the steady-state of phase distribution, the expected waiting time of an arbitrary regular patient is obtained. A total cost function which includes the penalty cost for unutilized medical resources and waiting cost of regular patients is constructed. The optimal arrival rate of regular patients so as to minimize the total cost is given by Kuhn–Tucker condition. Some numerical examples which are based on real data are given.

Suggested Citation

  • Jie Zhou & Jun Li, 2017. "An M/E k /1 queues with emergency non-preemptive priority of a diagnostic resource," Operational Research, Springer, vol. 17(1), pages 1-16, April.
    • Handle: RePEc:spr:operea:v:17:y:2017:i:1:d:10.1007_s12351-015-0211-z
    DOI: 10.1007/s12351-015-0211-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-015-0211-z
    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/s12351-015-0211-z?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. Gad Allon & Eran Hanany, 2012. "Cutting in Line: Social Norms in Queues," Management Science, INFORMS, vol. 58(3), pages 493-506, March.
    2. Krishnamoorthy, A. & Babu, S. & Narayanan, Viswanath C., 2009. "The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service," European Journal of Operational Research, Elsevier, vol. 195(1), pages 174-185, May.
    3. Diwakar Gupta & Lei Wang, 2008. "Revenue Management for a Primary-Care Clinic in the Presence of Patient Choice," Operations Research, INFORMS, vol. 56(3), pages 576-592, June.
    4. 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.
    5. Wang, Qinan, 2004. "Modeling and analysis of high risk patient queues," European Journal of Operational Research, Elsevier, vol. 155(2), pages 502-515, June.
    6. Jianzhe Luo & Vidyadhar G. Kulkarni & Serhan Ziya, 2012. "Appointment Scheduling Under Patient No-Shows and Service Interruptions," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 670-684, October.
    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. Van-Anh Truong, 2015. "Optimal Advance Scheduling," Management Science, INFORMS, vol. 61(7), pages 1584-1597, July.
    2. Ahmadi-Javid, Amir & Jalali, Zahra & Klassen, Kenneth J, 2017. "Outpatient appointment systems in healthcare: A review of optimization studies," European Journal of Operational Research, Elsevier, vol. 258(1), pages 3-34.
    3. Jie Zhou & Peng Guo, 2022. "Capacity management of CT department with service time differences and emergency nonpreemptive priority," Flexible Services and Manufacturing Journal, Springer, vol. 34(4), pages 960-978, December.
    4. Jiang, Yangzi & Abouee-Mehrizi, Hossein & Diao, Yuhe, 2020. "Data-driven analytics to support scheduling of multi-priority multi-class patients with wait time targets," European Journal of Operational Research, Elsevier, vol. 281(3), pages 597-611.
    5. Paola Cappanera & Filippo Visintin & Carlo Banditori & Daniele Feo, 2019. "Evaluating the long-term effects of appointment scheduling policies in a magnetic resonance imaging setting," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 212-254, March.
    6. Jin Kyung Kwak, 2023. "Analysis of the Waiting Time in Clinic Registration of Patients with Appointments and Random Walk-Ins," IJERPH, MDPI, vol. 20(3), pages 1-9, February.
    7. Iannoni, Ana Paula & Chiyoshi, Fernando & Morabito, Reinaldo, 2015. "A spatially distributed queuing model considering dispatching policies with server reservation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 49-66.
    8. Fournier, Derrick L. & Zaric, Gregory S., 2013. "Simulating neonatal intensive care capacity in British Columbia," Socio-Economic Planning Sciences, Elsevier, vol. 47(2), pages 131-141.
    9. Ruijie Zhang & Xiaohua Han & Rowan Wang & Jianghua Zhang & Yinghao Zhang, 2023. "Please don't make me wait! Influence of customers' waiting preference and no‐show behavior on appointment systems," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1597-1616, June.
    10. Eduardo Pérez, 2022. "An Appointment Planning Algorithm for Reducing Patient Check-In Waiting Times in Multispecialty Outpatient Clinics," SN Operations Research Forum, Springer, vol. 3(3), pages 1-22, September.
    11. Tugba Cayirli & Pinar Dursun & Evrim D. Gunes, 2019. "An integrated analysis of capacity allocation and patient scheduling in presence of seasonal walk-ins," Flexible Services and Manufacturing Journal, Springer, vol. 31(2), pages 524-561, June.
    12. Clifford Stein & Van-Anh Truong & Xinshang Wang, 2020. "Advance Service Reservations with Heterogeneous Customers," Management Science, INFORMS, vol. 66(7), pages 2929-2950, July.
    13. Yiwei Chen & Vivek F. Farias & Nikolaos Trichakis, 2019. "On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers," Management Science, INFORMS, vol. 65(12), pages 5535-5555, December.
    14. 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.
    15. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    16. Moshe Haviv & Eyal Winter, 2020. "An optimal mechanism charging for priority in a queue," Papers 2002.06533, arXiv.org.
    17. Asli Ozen & Hari Balasubramanian, 2013. "The impact of case mix on timely access to appointments in a primary care group practice," Health Care Management Science, Springer, vol. 16(2), pages 101-118, June.
    18. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    19. Zhu, Juanxiu & Hu, Lu & Jiang, Yangsheng & Khattak, Afaq, 2017. "Circulation network design for urban rail transit station using a PH(n)/PH(n)/C/C queuing network model," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1043-1068.
    20. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.

    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:operea:v:17:y:2017:i:1:d:10.1007_s12351-015-0211-z. 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.