IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v24y2021i4d10.1007_s10951-021-00692-9.html
   My bibliography  Save this article

A note on the complexity of two supply chain scheduling problems

Author

Listed:
  • Yuan Zhang

    (Zhengzhou University)

  • Jinjiang Yuan

    (Zhengzhou University)

Abstract

We consider two supply chain scheduling problems in which s suppliers preprocess different parts of the jobs to be assembled by the manufacturer under the common sequence constraint, with the goal of minimizing the total weighted number of tardy parts and minimizing the total late work of the parts, respectively. Ren et al. (Information Processing Letter 113: 609-601, 2013) showed that both of the above two problems are unary NP-hard. But their proof is invalid. In this paper, we present a new proof of the unary NP-hardness for the same problems.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jsched:v:24:y:2021:i:4:d:10.1007_s10951-021-00692-9
    DOI: 10.1007/s10951-021-00692-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00692-9
    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/s10951-021-00692-9?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 & Nicholas G. Hall, 2007. "Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems," Operations Research, INFORMS, vol. 55(6), pages 1072-1089, December.
    2. Nicholas G. Hall & Chris N. Potts, 2003. "Supply chain scheduling: Batching and delivery," Operations Research, INFORMS, vol. 51(4), pages 566-584, August.
    3. Thomas, Douglas J. & Griffin, Paul M., 1996. "Coordinated supply chain management," European Journal of Operational Research, Elsevier, vol. 94(1), pages 1-15, October.
    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. 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.
    2. 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.
    3. Tülin İnkaya & Mehmet Akansel, 2017. "Coordinated scheduling of the transfer lots in an assembly-type supply chain: a genetic algorithm approach," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 1005-1015, April.
    4. 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.
    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. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    7. 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.
    8. Xiuli Wang & T. C. Edwin Cheng, 2007. "Machine scheduling with an availability constraint and job delivery coordination," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 11-20, February.
    9. 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.
    10. 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.
    11. Zhang, Jian & Nault, Barrie R., 2023. "Information sharing in an MTO supply chain with upstream adjustments," European Journal of Operational Research, Elsevier, vol. 308(1), pages 97-112.
    12. Lei, Lei & Lee, Kangbok & Dong, Hui, 2016. "A heuristic for emergency operations scheduling with lead times and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 250(3), pages 726-736.
    13. Dongyang Wang & Kumar Muthuraman & Douglas Morrice, 2019. "Coordinated Patient Appointment Scheduling for a Multistation Healthcare Network," Operations Research, INFORMS, vol. 67(3), pages 599-618, May.
    14. 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.
    15. Chung‐Lun Li & Wen‐Qiang Xiao, 2004. "Lot streaming with supplier–manufacturer coordination," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 522-542, June.
    16. Jun Pei & Xinbao Liu & Panos M. Pardalos & Wenjuan Fan & Ling Wang & Shanlin Yang, 2016. "Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(4), pages 765-776, March.
    17. Nicholas G. Hall & Zhixin Liu, 2010. "Capacity Allocation and Scheduling in Supply Chains," Operations Research, INFORMS, vol. 58(6), pages 1711-1725, December.
    18. 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.
    19. Kathryn E. Stecke & Xuying Zhao, 2007. "Production and Transportation Integration for a Make-to-Order Manufacturing Company with a Commit-to-Delivery Business Mode," Manufacturing & Service Operations Management, INFORMS, vol. 9(2), pages 206-224, September.
    20. 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.

    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:jsched:v:24:y:2021:i:4:d:10.1007_s10951-021-00692-9. 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.