IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v217y2014i1p479-49010.1007-s10479-013-1522-1.html
   My bibliography  Save this article

Supply chain scheduling to minimize holding costs with outsourcing

Author

Listed:
  • Esaignani Selvarajah
  • Rui Zhang

Abstract

This paper addresses a scheduling problem in a flexible supply chain, in which the jobs can be either processed in house, or outsourced to a third-party supplier. The goal is to minimize the sum of holding and delivery costs. This problem is proved to be strongly $\mathcal{NP}$ -hard. Consider two special cases, in which the jobs have identical processing times. For the problem with limited outsourcing budgets, a $\mathcal{NP}$ -hardness proof, a pseudo-polynomial algorithm and a fully polynomial time approximation scheme are presented. For the problem with unlimited outsourcing budgets, the problem is shown to be equivalent to the shortest path problem, and therefore it is in class $\mathcal{P}$ . This shortest-path-problem solution approach is further shown to be applicable to a similar but more applicable problem, in which the number of deliveries is upper bounded. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:217:y:2014:i:1:p:479-490:10.1007/s10479-013-1522-1
    DOI: 10.1007/s10479-013-1522-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-013-1522-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-013-1522-1?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. Zhi-Long Chen & George L. Vairaktarakis, 2005. "Integrated Scheduling of Production and Distribution Operations," Management Science, INFORMS, vol. 51(4), pages 614-628, April.
    2. Zhi-Long Chen & Nicholas G. Hall, 2007. "Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems," Operations Research, INFORMS, vol. 55(6), pages 1072-1089, December.
    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. George Steiner & Rui Zhang, 2011. "Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties," Operations Research, INFORMS, vol. 59(6), pages 1504-1511, December.
    5. 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.
    6. Esaignani Selvarajah & George Steiner, 2009. "Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs," Operations Research, INFORMS, vol. 57(2), pages 426-438, April.
    7. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    8. Thomas, Douglas J. & Griffin, Paul M., 1996. "Coordinated supply chain management," European Journal of Operational Research, Elsevier, vol. 94(1), pages 1-15, October.
    9. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, 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. 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. Shang-Chia Liu & Chin-Chia Wu, 2016. "A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-11, October.
    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. 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.
    2. Agnetis, Alessandro & Aloulou, Mohamed Ali & Fu, Liang-Liang, 2014. "Coordination of production and interstage batch delivery with outsourced distribution," European Journal of Operational Research, Elsevier, vol. 238(1), pages 130-142.
    3. Cheng, Ba-Yi & Leung, Joseph Y-T. & Li, Kai, 2017. "Integrated scheduling on a batch machine to minimize production, inventory and distribution costs," European Journal of Operational Research, Elsevier, vol. 258(1), pages 104-112.
    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. Esaignani Selvarajah & George Steiner, 2009. "Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs," Operations Research, INFORMS, vol. 57(2), pages 426-438, April.
    6. Nicholas G. Hall & Zhixin Liu, 2010. "Capacity Allocation and Scheduling in Supply Chains," Operations Research, INFORMS, vol. 58(6), pages 1711-1725, December.
    7. Gao, Su & Qi, Lian & Lei, Lei, 2015. "Integrated batch production and distribution scheduling with limited vehicle capacity," International Journal of Production Economics, Elsevier, vol. 160(C), pages 13-25.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Averbakh, Igor, 2010. "On-line integrated production-distribution scheduling problems with capacitated deliveries," European Journal of Operational Research, Elsevier, vol. 200(2), pages 377-384, January.
    13. Feng Li & Zhou Xu & Zhi-Long Chen, 2020. "Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1012-1029, October.
    14. 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.
    15. Yuan Zhang & Jinjiang Yuan, 2021. "A note on the complexity of two supply chain scheduling problems," Journal of Scheduling, Springer, vol. 24(4), pages 447-454, August.
    16. 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.
    17. Weihua Liu & Yi Yang & Shuqing Wang & Enze Bai, 2017. "A scheduling model of logistics service supply chain based on the time windows of the FLSP’s operation and customer requirement," Annals of Operations Research, Springer, vol. 257(1), pages 183-206, October.
    18. Boysen, Nils & Scholl, Armin & Wopperer, Nico, 2012. "Resequencing of mixed-model assembly lines: Survey and research agenda," European Journal of Operational Research, Elsevier, vol. 216(3), pages 594-604.
    19. Li, Chung-Lun & Li, Feng, 2020. "Rescheduling production and outbound deliveries when transportation service is disrupted," European Journal of Operational Research, Elsevier, vol. 286(1), pages 138-148.
    20. Lixin Tang & Feng Li & Zhi-Long Chen, 2019. "Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 493-514, July.

    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:annopr:v:217:y:2014:i:1:p:479-490:10.1007/s10479-013-1522-1. 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.