Abstract
This paper deals with the single-machine scheduling problem in which each job has a release date, a processing time and a delivery time. Preemption is permitted and a sequence-independent setup time is incurred before processing a job. The objective is to find a schedule which minimizes the time by which all jobs are delivered. We show that the problem is NP-hard and propose a heuristic algorithm with a tight worst-case performance bound of 3 2 and which requires O( n log n) time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
