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

Two-machine flowshop scheduling in a physical examination center

Author

Listed:
  • Yadong Wang

    (Ludong University)

  • Baoqiang Fan

    (Ludong University)

  • Jingang Zhai

    (Ludong University)

  • Wei Xiong

    (Yantai Affiliated Hospital of Binzhou Medical University)

Abstract

In this paper, we formulate two important operational processes of the physical examination center as a group scheduling problem in two-machine flowshop. The objective is to minimize the makespan. We first analyze the complexity of the problem with a fixed number of release dates and present a pseudo-polynomial-time algorithm. Then we provide an approximation algorithm and analyze its worst-case error bounds for the problem with two release dates and an optimal algorithm for a very practical special case of the problem.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0233-y
    DOI: 10.1007/s10878-017-0233-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0233-y
    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-0233-y?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. Xingong Zhang & Hui Wang & Xingpeng Wang, 2015. "Patients scheduling problems with deferred deteriorated functions," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1027-1041, November.
    3. Fan, B.Q. & Cheng, T.C.E., 2016. "Two-agent scheduling in a flowshop," European Journal of Operational Research, Elsevier, vol. 252(2), pages 376-384.
    4. Leung, Joseph Y.-T. & Li, Haibing & Pinedo, Michael, 2006. "Scheduling orders for multiple product types with due date related objectives," European Journal of Operational Research, Elsevier, vol. 168(2), pages 370-389, January.
    5. C. N. Potts, 1985. "Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 576-584, November.
    6. C. N. Potts & S. V. Sevast'janov & V. A. Strusevich & L. N. Van Wassenhove & C. M. Zwaneveld, 1995. "The Two-Stage Assembly Scheduling Problem: Complexity and Approximation," Operations Research, INFORMS, vol. 43(2), pages 346-355, April.
    7. 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.
    8. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    9. Leslie A. Hall, 1994. "A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem," Mathematics of Operations Research, INFORMS, vol. 19(1), pages 68-85, February.
    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. Jing Fan & Hui Shi, 2021. "A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 896-908, November.
    2. 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.

    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. M Haouari & T Ladhari, 2007. "Minimizing maximum lateness in a flow shop subject to release dates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 62-72, January.
    2. Zhenyuan Liu & Jiongbing Lu & Zaisheng Liu & Guangrui Liao & Hao Howard Zhang & Junwu Dong, 2019. "Patient scheduling in hemodialysis service," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 337-362, January.
    3. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    4. Wenhua Li & Xing Chai, 2019. "The medical laboratory scheduling for weighted flow-time," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 83-94, January.
    5. Fernandez-Viagas, Victor & Talens, Carla & Framinan, Jose M., 2022. "Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 869-882.
    6. Sean Harris & David Claudio, 2022. "Current Trends in Operating Room Scheduling 2015 to 2020: a Literature Review," SN Operations Research Forum, Springer, vol. 3(1), pages 1-42, March.
    7. 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.
    8. Ladhari, Talel & Rakrouki, Mohamed Ali, 2009. "Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop," International Journal of Production Economics, Elsevier, vol. 122(2), pages 678-691, December.
    9. Wlodzimierz Szwarc & Jatinder N. D. Gupta, 1987. "A flow‐shop problem with sequence‐dependent additive setup times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 619-627, October.
    10. Park, Moon-Won & Kim, Yeong-Dae, 2000. "A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints," European Journal of Operational Research, Elsevier, vol. 123(3), pages 504-518, June.
    11. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    12. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.
    13. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    14. Niloy J. Mukherjee & Subhash C. Sarin & Daniel A. Neira, 2023. "Lot streaming for a two-stage assembly system in the presence of handling costs," Journal of Scheduling, Springer, vol. 26(4), pages 335-351, August.
    15. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    16. Vineet Jain & Tilak Raj, 2018. "An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: a case study," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(6), pages 1302-1314, December.
    17. 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.
    18. 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.
    19. T.C. Edwin Cheng & Qingqin Nong & Chi To Ng, 2011. "Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 763-770, December.
    20. 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.

    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-0233-y. 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.