IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i1d10.1007_s10878-017-0246-6.html
   My bibliography  Save this article

Large-scale medical examination scheduling technology based on intelligent optimization

Author

Listed:
  • Jiawei Zhang

    (National University of Defense Technology)

  • Ling Wang

    (Tsinghua University)

  • Lining Xing

    (National University of Defense Technology)

Abstract

In recent years, the scale of the health examination business has increased rapidly, and research on the combinatorial optimization of medical examinations has become more important. In this context, a special large-scale flexible open shop scheduling problem (FOSP) is introduced based on the idea of the multi-processor open shop scheduling problem. A mixed integer programming model is developed for the FOSP, which regards client satisfaction as the most important objective. As the FOSP is particularly complex, three different intelligent optimization algorithms are examined, namely a genetic algorithm, hybrid particle swarm optimization, and simulated annealing. According to the medical examination preferences of the clients, a group of large-scale test problems are created on the basis of benchmark instances of the flexible job shop problem, and these are used to evaluate the performance of each algorithm. The experimental results show that the genetic algorithm outperforms both simulated annealing and hybrid particle swarm optimization, especially in large-scale problems.

Suggested Citation

  • Jiawei Zhang & Ling Wang & Lining Xing, 2019. "Large-scale medical examination scheduling technology based on intelligent optimization," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 385-404, January.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0246-6
    DOI: 10.1007/s10878-017-0246-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0246-6
    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/s10878-017-0246-6?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. Liwei Zhong & Shoucheng Luo & Lidong Wu & Lin Xu & Jinghui Yang & Guochun Tang, 2014. "A two-stage approach for surgery scheduling," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 545-556, April.
    2. Qijia Liu & Jinjiang Yuan, 2016. "Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 385-395, August.
    3. Matta, Marie E. & Elmaghraby, Salah E., 2010. "Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop," European Journal of Operational Research, Elsevier, vol. 201(3), pages 720-728, March.
    4. Tamer Abdelmaguid & Mohamed Shalaby & Mohamed Awwad, 2014. "A tabu search approach for proportionate multiprocessor open shop scheduling," Computational Optimization and Applications, Springer, vol. 58(1), pages 187-203, May.
    5. Ran Ma & Jinjiang Yuan, 2017. "Online scheduling to minimize the total weighted completion time plus the rejection cost," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 483-503, August.
    6. Dujuan Wang & Feng Liu & Yunqiang Yin & Jianjun Wang & Yanzhang Wang, 2015. "Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 967-981, November.
    7. Xueling Zhong & Zhangming Pan & Dakui Jiang, 2017. "Scheduling with release times and rejection on two parallel machines," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 934-944, April.
    8. Jueliang Hu & Yiwei Jiang & Ping Zhou & An Zhang & Qinghui Zhang, 2017. "Total completion time minimization in online hierarchical scheduling of unit-size jobs," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 866-881, April.
    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. Xu Tan & Lining Xing & Zhaoquan Cai & Gaige Wang, 2020. "Analysis of production cycle-time distribution with a big-data approach," Journal of Intelligent Manufacturing, Springer, vol. 31(8), pages 1889-1897, December.
    2. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    3. Zeynep Adak & Mahmure Övül Arıoğlu & Serol Bulkan, 2022. "An ant colony optimization approach for the proportionate multiprocessor open shop," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 785-817, May.
    4. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 2020. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 547-569, August.

    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. Yadong Wang & Baoqiang Fan & Jingang Zhai & Wei Xiong, 2019. "Two-machine flowshop scheduling in a physical examination center," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 363-374, January.
    2. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    3. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 2020. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 547-569, August.
    4. Baruch Mor & Gur Mosheiov & Dana Shapira, 2021. "Single machine lot scheduling with optional job-rejection," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 1-11, January.
    5. Zeynep Adak & Mahmure Övül Arıoğlu & Serol Bulkan, 2022. "An ant colony optimization approach for the proportionate multiprocessor open shop," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 785-817, May.
    6. Shahaboddin Shamshirband & Mohammad Shojafar & A. Hosseinabadi & Maryam Kardgar & M. Nasir & Rodina Ahmad, 2015. "OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises," Annals of Operations Research, Springer, vol. 229(1), pages 743-758, June.
    7. Beibei Li & Zhihong Zhao & Xuan Shen & Cendi Xue & Liwei Zhong, 2015. "Fitting $$\alpha $$ α $$\beta $$ β -crystalline structure onto electron microscopy based on SO(3) rotation group theory," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 906-919, November.
    8. Jing Li & Ming Dong & Yijiong Ren & Kaiqi Yin, 2015. "How patient compliance impacts the recommendations for colorectal cancer screening," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 920-937, November.
    9. Cheng He & Changchun Liu & Tao Wu & Ying Xu & Yang Wu & Tong Chen, 2021. "Medical rolling bearing fault prognostics based on improved extreme learning machine," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 700-721, November.
    10. Ma, Ran & Guo, Sainan & Miao, Cuixia, 2021. "A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    11. Wei Gao & Wuping Bao & Xin Zhou, 2019. "Analysis of cough detection index based on decision tree and support vector machine," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 375-384, January.
    12. Yanqin Bai & Xiao Han & Tong Chen & Hua Yu, 2015. "Quadratic kernel-free least squares support vector machine for target diseases classification," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 850-870, November.
    13. Jing Fan & Hui Shi, 0. "A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    14. Jian Chang & Lingjuan Zhang, 2019. "Case Mix Index weighted multi-objective optimization of inpatient bed allocation in general hospital," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 1-19, January.
    15. Hanane Krim & Nicolas Zufferey & Jean-Yves Potvin & Rachid Benmansour & David Duvivier, 2022. "Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times," Journal of Scheduling, Springer, vol. 25(1), pages 89-105, February.
    16. Baruch Mor & Gur Mosheiov, 2018. "A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection," Annals of Operations Research, Springer, vol. 271(2), pages 1079-1085, December.
    17. Ma, Ran & Guo, Sainan, 2021. "Applying “Peeling Onion” approach for competitive analysis in online scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 290(1), pages 57-67.
    18. Mengzhuo Bai & Chunyang Ren & Yang Liu, 2015. "A note of reduced dimension optimization algorithm of assignment problem," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 841-849, November.
    19. Hongbo Li & Li Wang & Xuan Xia & Hongbo Liu, 0. "Perceived service quality’s effect on patient loyalty through patient attitude within the context of traditional Chinese medicine," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    20. Dujuan Wang & Feng Liu & Yunqiang Yin & Jianjun Wang & Yanzhang Wang, 2015. "Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 967-981, November.

    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:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0246-6. 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.