Abstract
The computational complexity of the problem of scheduling a set of start-time dependent tasks with deadlines and identical decreasing rates of processing times on a single machine to minimize the makespan is open. In this paper we show that the problem is strongly NP-complete by a reduction from 3-Partition. Scope and purpose There has been increasing interest in scheduling models where the job processing times are a function of their starting times. There are many practical scheduling problems that can be modeled in this way. We study one such model where the job processing times decrease linearly with their starting times. The jobs have the same processing time decreasing rates but each job has an individual deadline which cannot be exceeded. The problem is to find a feasible schedule satisfying the deadline constraints that minimizes the makespan. This is an open problem in the literature and we show that it is strongly NP-complete. Thus, future research on this model should be focussed on the design of effective heuristics.
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.
