Abstract
We revisit the single-machine preemptive scheduling problem to minimize total completion time with release times and deadlines. Du and Leung (1993) showed that the problem is binary NP-hard. But the exact complexity (unary NP-hardness or pseudo-polynomial-time solvability) of the problem is a long standing open problem. We show in this paper that the problem is unary NP-hard.
Sign-in/Register to access full text options 
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.
