Abstract
This article addresses deterministic, nonpreemptive scheduling of n jobs with unequal release times on a single machine to minimize the sum of job completion times. This problem is known to be NP-hard. The article compares six available lower bounds in the literature and shows that the lower bound based on the optimal solution to the preemptive version of the problem is the dominant lower bound.
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.
