IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i7d10.1057_jors.2010.73.html
   My bibliography  Save this article

Use of VNS heuristics for scheduling of patients in hospital

Author

Listed:
  • S Vlah

    (University of Zagreb)

  • Z Lukač

    (University of Zagreb)

  • J Pacheco

    (University of Burgos)

Abstract

One of the important problems in hospital management is how to schedule the treatments of resident patients in hospital for a given day due to the restrictions imposed by their medical condition as well as restrictions on medical machines and qualified medical personnel availability. Patients are to be subjected to different kinds of treatments, each requiring a medical machine of a certain type as well as a physician being qualified to operate it. This is a highly complex problem not yet adequately addressed in the literature. At present in most hospitals the problem is being solved manually by specialized personnel. However, the resulting schedules are very often inaccurate and inefficient with patients waiting for a long time to be treated and medical personnel often working overtime. In this paper we formulate the model for this problem and develop a simple and efficient method based on Variable Neighbourhood Search for solving it. The heuristics has been tested on real-life as well as on generated instances. Numerical results show that the heuristics proposed outperform commercial software for optimization as well as manual solutions both in quality of solution and in computational time.

Suggested Citation

  • S Vlah & Z Lukač & J Pacheco, 2011. "Use of VNS heuristics for scheduling of patients in hospital," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1227-1238, July.
  • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:7:d:10.1057_jors.2010.73
    DOI: 10.1057/jors.2010.73
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2010.73
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/jors.2010.73?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. Cheang, B. & Li, H. & Lim, A. & Rodrigues, B., 2003. "Nurse rostering problems--a bibliographic survey," European Journal of Operational Research, Elsevier, vol. 151(3), pages 447-460, December.
    2. de Souza, Mauricio C. & Martins, Pedro, 2008. "Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 677-690, December.
    3. Chern, Ching-Chin & Chien, Pei-Szu & Chen, Shu-Yi, 2008. "A heuristic algorithm for the hospital health examination scheduling problem," European Journal of Operational Research, Elsevier, vol. 186(3), pages 1137-1157, May.
    4. Belií«n, Jeroen & Demeulemeester, Erik, 2008. "A branch-and-price approach for integrating nurse and surgery scheduling," European Journal of Operational Research, Elsevier, vol. 189(3), pages 652-668, September.
    5. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    6. C Vasilakis & B G Sobolev & L Kuramoto & A R Levy, 2007. "A simulation study of scheduling clinic appointments in surgical care: individual surgeon versus pooled lists," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(2), pages 202-211, February.
    7. Negenman, Ebbe G., 2001. "Local search algorithms for the multiprocessor flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 147-158, January.
    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. Shuwan Zhu & Wenjuan Fan & Shanlin Yang & Jun Pei & Panos M. Pardalos, 2019. "Operating room planning and surgical case scheduling: a review of literature," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 757-805, April.

    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. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    2. Wenjuan Fan & Yi Wang & Tongzhu Liu & Guixian Tong, 2020. "A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 547-580, February.
    3. Broos Maenhout & Mario Vanhoucke, 2008. "Comparison and hybridization of crossover operators for the nurse scheduling problem," Annals of Operations Research, Springer, vol. 159(1), pages 333-353, March.
    4. Wright, P. Daniel & Mahar, Stephen, 2013. "Centralized nurse scheduling to simultaneously improve schedule cost and nurse satisfaction," Omega, Elsevier, vol. 41(6), pages 1042-1052.
    5. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.
    6. Mengyu Guo & Su Wu & Binfeng Li & Jie Song & Youping Rong, 2016. "Integrated scheduling of elective surgeries and surgical nurses for operating room suites," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 166-181, June.
    7. Jens Brunner & Günther Edenharter, 2011. "Long term staff scheduling of physicians with different experience levels in hospitals using column generation," Health Care Management Science, Springer, vol. 14(2), pages 189-202, June.
    8. Dohn, Anders & Mason, Andrew, 2013. "Branch-and-price for staff rostering: An efficient implementation using generic programming and nested column generation," European Journal of Operational Research, Elsevier, vol. 230(1), pages 157-169.
    9. Schoenfelder, Jan & Bretthauer, Kurt M. & Wright, P. Daniel & Coe, Edwin, 2020. "Nurse scheduling with quick-response methods: Improving hospital performance, nurse workload, and patient experience," European Journal of Operational Research, Elsevier, vol. 283(1), pages 390-403.
    10. Kortbeek, N. & Braaksma, A. & Burger, C.A.J. & Bakker, P.J.M. & Boucherie, R.J., 2015. "Flexible nurse staffing based on hourly bed census predictions," International Journal of Production Economics, Elsevier, vol. 161(C), pages 167-180.
    11. Volland, Jonas & Fügener, Andreas & Brunner, Jens O., 2017. "A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals," European Journal of Operational Research, Elsevier, vol. 260(1), pages 316-334.
    12. Marynissen, Joren & Demeulemeester, Erik, 2019. "Literature review on multi-appointment scheduling problems in hospitals," European Journal of Operational Research, Elsevier, vol. 272(2), pages 407-419.
    13. Chern, Ching-Chin & Chien, Pei-Szu & Chen, Shu-Yi, 2008. "A heuristic algorithm for the hospital health examination scheduling problem," European Journal of Operational Research, Elsevier, vol. 186(3), pages 1137-1157, May.
    14. Shuwan Zhu & Wenjuan Fan & Shanlin Yang & Jun Pei & Panos M. Pardalos, 2019. "Operating room planning and surgical case scheduling: a review of literature," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 757-805, April.
    15. Federico Della Croce & Fabio Salassa, 2014. "A variable neighborhood search based matheuristic for nurse rostering problems," Annals of Operations Research, Springer, vol. 218(1), pages 185-199, July.
    16. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    17. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    18. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    19. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2018. "Minimizing Piecewise-Concave Functions Over Polyhedra," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 580-597, May.
    20. Fernandez del Pozo, J. A. & Bielza, C. & Gomez, M., 2005. "A list-based compact representation for large decision tables management," European Journal of Operational Research, Elsevier, vol. 160(3), pages 638-662, February.

    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:pal:jorsoc:v:62:y:2011:i:7:d:10.1057_jors.2010.73. 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.palgrave-journals.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.