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

Two-stage medical supply chain scheduling with an assignable common due window and shelf life

Author

Listed:
  • Long Zhang

    (Qufu Normal University)

  • Yuzhong Zhang

    (Qufu Normal University)

  • Qingguo Bai

    (Qufu Normal University)

Abstract

This paper considers a two-stage medical supply chain scheduling problem from the perspective of the medicine manufacturer in which jobs have an assignable common due window and shelf life. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. The job’s holding time, which is the time interval that passes from the completion time of the job to the delivery date of the job in the batch, must be no more than its shelf life. The objective is to minimize the total cost comprising earliness, weighted number of tardy jobs, holding time, due window starting time, window size, and batch delivery. We first show that the problem is NP-hard and then provide a pseudo-polynomial-time algorithm. We also prove that a special case of the problem can be optimally solved in polynomial time.

Suggested Citation

  • Long Zhang & Yuzhong Zhang & Qingguo Bai, 2019. "Two-stage medical supply chain scheduling with an assignable common due window and shelf life," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 319-329, January.
  • Handle: RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0228-8
    DOI: 10.1007/s10878-017-0228-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0228-8
    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-0228-8?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. Bilge Bilgen & Yelda Çelebi, 2013. "Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling," Annals of Operations Research, Springer, vol. 211(1), pages 55-82, December.
    2. Herrmann, Jeffrey W. & Lee, Chung-Yee, 1993. "On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date," European Journal of Operational Research, Elsevier, vol. 70(3), pages 272-288, November.
    3. Baruch Mor & Gur Mosheiov, 2017. "A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1454-1468, May.
    4. Yin, Yunqiang & Cheng, T.C.E. & Hsu, Chou-Jung & Wu, Chin-Chia, 2013. "Single-machine batch delivery scheduling with an assignable common due window," Omega, Elsevier, vol. 41(2), pages 216-225.
    5. Lili Liu & Guochun Tang & Baoqiang Fan & Xingpeng Wang, 2015. "Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 938-948, November.
    6. Chen, Zhi-Long, 1996. "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 93(1), pages 49-60, August.
    7. Hua Gong & Biao Zhang & Wuliang Peng, 2015. "Scheduling and Common Due Date Assignment on a Single Parallel-Batching Machine with Batch Delivery," Discrete Dynamics in Nature and Society, Hindawi, vol. 2015, pages 1-7, April.
    8. Mohammadi, Maryam & Musa, Siti Nurmaya & Bahreininejad, Ardeshir, 2015. "Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 404-422.
    9. Yan, Changyuan & Liao, Yi & Banerjee, Avijit, 2013. "Multi-product lot scheduling with backordering and shelf-life constraints," Omega, Elsevier, vol. 41(3), pages 510-516.
    10. 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.
    11. Hans-Otto Günther & Paul Beek & Martin Grunow & Matthias Lütke Entrup & Shuo Zhang, 2006. "An MILP Modelling Approach for Shelf Life Integrated Planning and Scheduling in Scalded Sausage Production," Springer Books, in: Martin Morlock & Christoph Schwindt & Norbert Trautmann & Jürgen Zimmermann (ed.), Perspectives on Operations Research, pages 163-188, Springer.
    12. M. Lütke Entrup & M. Grunow & H.O. Günther & T. Seiler & P. Beek, 2005. "An Milp Modelling Approach for Shelf Life Integrated Planning in Yoghurt Production," Operations Research Proceedings, in: Hein Fleuren & Dick Hertog & Peter Kort (ed.), Operations Research Proceedings 2004, pages 67-75, Springer.
    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. Gengjun Gao & Yuxuan Che & Jian Shen, 0. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    2. Long Zhang & Yuzhong Zhang & Qingguo Bai, 0. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    3. Gengjun Gao & Yuxuan Che & Jian Shen, 2021. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 866-883, November.
    4. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2022. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2167-2179, November.

    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. Yunqiang Yin & Doudou Li & Dujuan Wang & T. C. E. Cheng, 2021. "Single-machine serial-batch delivery scheduling with two competing agents and due date assignment," Annals of Operations Research, Springer, vol. 298(1), pages 497-523, March.
    2. Long Zhang & Yuzhong Zhang & Qingguo Bai, 0. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    3. Yunqiang Yin & Yongjian Yang & Dujuan Wang & T.C.E. Cheng & Chin‐Chia Wu, 2018. "Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(5), pages 393-409, August.
    4. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2022. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2167-2179, November.
    5. 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.
    6. Wang, Guoqing & Cheng, T. C. Edwin, 2000. "Parallel machine scheduling with batch delivery costs," International Journal of Production Economics, Elsevier, vol. 68(2), pages 177-183, November.
    7. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    8. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    9. Gengjun Gao & Yuxuan Che & Jian Shen, 0. "Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    10. Maliheh Ganji & Rahmat Rabet & Seyed Mojtaba Sajadi, 2022. "A new coordinating model for green supply chain and batch delivery scheduling with satisfaction customers," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 24(4), pages 4566-4601, April.
    11. Guruprasad Pundoor & Zhi‐Long Chen, 2005. "Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 571-589, September.
    12. Huidan Lin & Qun Li & Xueguo Xu & Ying Zhang, 2021. "Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 848-865, November.
    13. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    14. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    15. Öncü Hazır & Safia Kedad-Sidhoum, 2014. "Batch sizing and just-in-time scheduling with common due date," Annals of Operations Research, Springer, vol. 213(1), pages 187-202, February.
    16. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    17. Zhi-Long Chen & Guruprasad Pundoor, 2006. "Order Assignment and Scheduling in a Supply Chain," Operations Research, INFORMS, vol. 54(3), pages 555-572, June.
    18. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    19. Sun Lee, Ik & Yoon, S.H., 2010. "Coordinated scheduling of production and delivery stages with stage-dependent inventory holding costs," Omega, Elsevier, vol. 38(6), pages 509-521, December.
    20. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.

    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-0228-8. 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.