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

A heuristic algorithm for the hospital health examination scheduling problem

Author

Listed:
  • Chern, Ching-Chin
  • Chien, Pei-Szu
  • Chen, Shu-Yi

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:186:y:2008:i:3:p:1137-1157
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00275-5
    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. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    2. 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.
    3. Dowsland, Kathryn A., 1998. "Nurse scheduling with tabu search and strategic oscillation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 393-407, April.
    4. Millar, Harvey H. & Kiragu, Mona, 1998. "Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming," European Journal of Operational Research, Elsevier, vol. 104(3), pages 582-592, February.
    5. Kim, Seung-Chul & Horowitz, Ira, 2002. "Scheduling hospital services: the efficacy of elective-surgery quotas," Omega, Elsevier, vol. 30(5), pages 335-346, October.
    6. 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.
    7. Bard, Jonathan F. & Purnomo, Hadi W., 2005. "Preference scheduling for nurses using column generation," European Journal of Operational Research, Elsevier, vol. 164(2), pages 510-534, July.
    8. Bard, Jonathan F. & Purnomo, Hadi W., 2005. "A column generation-based approach to solve the preference scheduling problem for nurses with downgrading," Socio-Economic Planning Sciences, Elsevier, vol. 39(3), pages 193-213, September.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Domenico Conforti & Francesca Guerriero & Rosita Guido & Marco Cerinic & Maria Conforti, 2011. "An optimal decision making model for supporting week hospital management," Health Care Management Science, Springer, vol. 14(1), pages 74-88, March.

    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. Vanhoucke, Mario & Maenhout, Broos, 2009. "On the characterization and generation of nurse scheduling problem instances," European Journal of Operational Research, Elsevier, vol. 196(2), pages 457-467, July.
    2. Topaloglu, Seyda, 2009. "A shift scheduling model for employees with different seniority levels and an application in healthcare," European Journal of Operational Research, Elsevier, vol. 198(3), pages 943-957, November.
    3. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
    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. Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.
    6. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    7. Burke, Edmund K. & Curtois, Timothy & Post, Gerhard & Qu, Rong & Veltman, Bart, 2008. "A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 330-341, July.
    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. Turhan, Aykut Melih & Bilgen, Bilge, 2022. "A mat-heuristic based solution approach for an extended nurse rostering problem with skills and units," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    10. Valouxis, Christos & Gogos, Christos & Goulas, George & Alefragis, Panayiotis & Housos, Efthymios, 2012. "A systematic two phase approach for the nurse rostering problem," European Journal of Operational Research, Elsevier, vol. 219(2), pages 425-433.
    11. 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.
    12. Eyjólfur Ingi Ásgeirsson & Guðríður Lilla Sigurðardóttir, 2016. "Near-optimal MIP solutions for preference based self-scheduling," Annals of Operations Research, Springer, vol. 239(1), pages 273-293, April.
    13. Eyjólfur Ásgeirsson, 2014. "Bridging the gap between self schedules and feasible schedules in staff scheduling," Annals of Operations Research, Springer, vol. 218(1), pages 51-69, July.
    14. 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.
    15. Paola Cappanera & Filippo Visintin & Roberta Rossi, 2022. "The emergency department physician rostering problem: obtaining equitable solutions via network optimization," Flexible Services and Manufacturing Journal, Springer, vol. 34(4), pages 916-959, December.
    16. Farasat, Alireza & Nikolaev, Alexander G., 2016. "Signed social structure optimization for shift assignment in the nurse scheduling problem," Socio-Economic Planning Sciences, Elsevier, vol. 56(C), pages 3-13.
    17. Chiaramonte, Michael V. & Chiaramonte, Laurel M., 2008. "An agent-based nurse rostering system under minimal staffing conditions," International Journal of Production Economics, Elsevier, vol. 114(2), pages 697-713, August.
    18. Burke, Edmund K. & Li, Jingpeng & Qu, Rong, 2010. "A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 484-493, June.
    19. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    20. Frederik Knust & Lin Xie, 2019. "Simulated annealing approach to nurse rostering benchmark and real-world instances," Annals of Operations Research, Springer, vol. 272(1), pages 187-216, January.

    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:186:y:2008:i:3:p:1137-1157. 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.