A note on the complexity of two supply chain scheduling problems

Yuan Zhang and Jinjiang Yuan ()
Additional contact information
Yuan Zhang: Zhengzhou University
Jinjiang Yuan: Zhengzhou University

Journal of Scheduling, 2021, vol. 24, issue 4, No 6, 447-454

Abstract: 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.

Keywords: Scheduling; Supply chains; Computational complexity; Unary NP-hardness (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-021-00692-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:24:y:2021:i:4:d:10.1007_s10951-021-00692-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-021-00692-9

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().