IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/vyid10.1007_s10878-019-00500-3.html
   My bibliography  Save this article

A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital

Author

Listed:
  • Jing Fan

    (Shanghai Polytechnic University)

  • Hui Shi

    (Shanghai Jiaotong University)

Abstract

In a hospital, the nursing assistants in wards are always responsible for delivering patients to do some medical examinations, and the nursing assistants in the medical departments need take these patients back to the corresponding wards after examinations. We transform this actual problem about nursing assistants’ daily work into a three-stage supply chain scheduling problem if patients are regarded as jobs, the ward as the customer, the nursing assistants as vehicles and the medical department as the processing machine in the factory. The capacity of each vehicle is limited because the nursing assistant only can deliver several patients once. And the transportation schedule back and forth between the customer and the factory are the same in view of the actual arrangement. In order to reduce the average consumption time of patients, the objective is to minimize the total flowtime, that is, the sum of arrival time of every completed job back to the customer. We show that the problem is NP-hard in the strong sense, and provide an approximation algorithm with the performance ratio of 2. Moreover, we study some polynomially solvable cases of the problem.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-019-00500-3
    DOI: 10.1007/s10878-019-00500-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00500-3
    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-019-00500-3?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. Huiqiao Su & Guohua Wan & Shan Wang, 2019. "Online scheduling for outpatient services with heterogeneous patients and physicians," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 123-149, January.
    3. Nicholas G. Hall & Chris N. Potts, 2003. "Supply chain scheduling: Batching and delivery," Operations Research, INFORMS, vol. 51(4), pages 566-584, August.
    4. 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.
    5. Ying Yang & Shoucheng Luo & Jing Fan & Xinye Zhou & Chunyu Fu & Guochun Tang, 2019. "Study on specialist outpatient matching appointment and the balance matching model," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 20-39, January.
    6. Gang Du & Luyao Zheng & Xiaoling Ouyang, 2019. "Real-time scheduling optimization considering the unexpected events in home health care," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 196-220, January.
    7. Feng Zhang & Jing Li & Junxiang Fan & Huili Shen & Jian Shen & Hua Yu, 2019. "Three-dimensional stable matching with hybrid preferences," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 330-336, January.
    8. Jing Fan & Xiwen Lu, 2015. "Supply chain scheduling problem in the hospital with periodic working time on a single machine," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 892-905, November.
    9. Wang, Xiuli & Cheng, T.C.E., 2009. "Production scheduling with supply and delivery considerations to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 194(3), pages 743-752, May.
    10. Chung‐Lun Li & Jinwen Ou, 2005. "Machine scheduling with pickup and delivery," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(7), pages 617-630, October.
    11. 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.
    12. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    13. Liwei Zhong & Yanqin Bai, 2019. "Three-sided stable matching problem with two of them as cooperative partners," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 286-292, January.
    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. 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. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    3. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    4. B.‐Y. Cheng & J.Y.‐T. Leung & K. Li & S.‐L. Yang, 2015. "Single batch machine scheduling with deliveries," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(6), pages 470-482, September.
    5. Ali Gharaei & Fariborz Jolai, 2021. "A Pareto approach for the multi-factory supply chain scheduling and distribution problem," Operational Research, Springer, vol. 21(4), pages 2333-2364, December.
    6. J. Behnamian & Z. Gharabaghli, 2023. "Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-35, March.
    7. Azeddine Cheref & Alessandro Agnetis & Christian Artigues & Jean-Charles Billaut, 2017. "Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence," Journal of Scheduling, Springer, vol. 20(6), pages 681-693, December.
    8. Xin Feng & Yongxi Cheng & Feifeng Zheng & Yinfeng Xu, 2016. "Online integrated production–distribution scheduling problems without preemption," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1569-1585, May.
    9. Liang Tang & Zhihong Jin & Xuwei Qin & Ke Jing, 2019. "Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design," Annals of Operations Research, Springer, vol. 275(2), pages 685-714, April.
    10. Han, Bin & Zhang, Wenjun & Lu, Xiwen & Lin, Yingzi, 2015. "On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost," European Journal of Operational Research, Elsevier, vol. 244(3), pages 704-714.
    11. Zeynep Ceylan & Hakan Tozan & Serol Bulkan, 2021. "A coordinated scheduling problem for the supply chain in a flexible job shop machine environment," Operational Research, Springer, vol. 21(2), pages 875-900, June.
    12. Gang Du & Xi Liang & Xiaoling Ouyang & Chunming Wang, 0. "Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    13. Zhong, Xueling & Fan, Jie & Ou, Jinwen, 2022. "Coordinated scheduling of the outsourcing, in-house production and distribution operations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 427-437.
    14. Zhang, Jian & Nault, Barrie R. & Tu, Yiliu, 2015. "A dynamic pricing strategy for a 3PL provider with heterogeneous customers," International Journal of Production Economics, Elsevier, vol. 169(C), pages 31-43.
    15. Feng Zhang & Liwei Zhong, 0. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-9.
    16. Nodari Vakhania & Badri Mamporia, 2020. "Fast Algorithms for Basic Supply Chain Scheduling Problems," Mathematics, MDPI, vol. 8(11), pages 1-19, November.
    17. Rasti-Barzoki, Morteza & Hejazi, Seyed Reza, 2013. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains," European Journal of Operational Research, Elsevier, vol. 228(2), pages 345-357.
    18. Nicholas G. Hall & Zhixin Liu, 2010. "Capacity Allocation and Scheduling in Supply Chains," Operations Research, INFORMS, vol. 58(6), pages 1711-1725, December.
    19. Gang Du & Xi Liang & Xiaoling Ouyang & Chunming Wang, 2021. "Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 966-987, November.
    20. Feng Zhang & Liwei Zhong, 2021. "Three-sided matching problem with mixed preferences," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 928-936, 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::y::i::d:10.1007_s10878-019-00500-3. 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.