Skip to main content
SpringerLink
Log in

A note on the complexity of two supply chain scheduling problems

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

References

  • Agnetis, A., Hall, N. G., & Pacciarelli, D. (2006). Supply chain scheduling: sequence coordination. Discrete Applied Mathematics, 154, 2044–2063.

  • Chen, Z. L., & Hall, N. G. (2007). Supply chain scheduling: conflict and cooperation in assembly systems. Operations Research, 55, 1072–1089.

    Article  Google Scholar 

  • Dawande, M., Geismar, H. N., Hall, N. G., & Sriskandarajah, C. (2006). Supply chain scheduling: distribution systems. Production and Operations Management, 15, 243–261.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of np-completeness. NewYork: W.H. Freeman.

    Google Scholar 

  • Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51, 566–584.

    Article  Google Scholar 

  • Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2003). Concurrent open shop scheduling to minimize the weighted number of tardy jobs. Journal of Scheduling, 6, 405–412.

    Article  Google Scholar 

  • Ren, J. F., Du, D. L., & Xu, D. C. (2013). The complexity of two supply chain scheduling problems. Information Processing Letters, 113, 609–612.

    Article  Google Scholar 

  • Sarmieto, A. M., & Nagi, R. (1999). A review of integrated analysis of production-distribution systems. IIE Transactions, 31, 1061–1074.

    Google Scholar 

  • Thomas, D. J., & Griffin, P. M. (1996). Coordinated supply chain managament. European Journal of Operational Research, 94, 1–15.

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the Associate Editor (AE) and one anonymous referee for their constructive comments and helpful suggestions. This research was supported in part by the National Natural Science Foundation of China under grant numbers 12701442 and 11771406.

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan, 450001, People’s Republic of China

    Yuan Zhang & Jinjiang Yuan

Authors
  1. Yuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinjiang Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinjiang Yuan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Y., Yuan, J. A note on the complexity of two supply chain scheduling problems. J Sched 24, 447–454 (2021). https://doi.org/10.1007/s10951-021-00692-9

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-021-00692-9

Keywords

Search

Navigation