Abstract
We consider an assembling manufacture system where several suppliers provide component parts to a manufacturer, who assembles products from all the supplied component parts. The delivery time of any product is the maximum of the suppliersʼ delivery time of the parts needed for that product. We assume that the final stage is non-bottleneck. Chen and Hall (2007) show that the suppliersʼ problem of minimizing the total weighted number of tardy parts is binary (i.e., weakly) NP-hard and left open whether it is unary (i.e., strongly) NP-hard. In this paper we resolve this open problem by showing that it is unary NP-hard. Moreover we show that the suppliersʼ problem of minimizing the total late work of parts is also unary NP-hard.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
