Abstract
In this paper, we consider the parallel-machine scheduling with step-deteriorating jobs. The actual processing time of each job deteriorates as a step function if its starting time is beyond a given deteriorating date. We focus on the case of the common job deteriorating date. For the minimization problem of total completion time, we first show that the problem is NP-hard in the strong sense. Then we propose one property of any optimal schedule. Furthermore, we prove that two special cases of common normal processing time or common penalty are polynomially solvable. For the minimization problem of total weighted completion time, we analyze the NP-hardness and present a polynomial time optimal algorithm for the case of common normal processing time and common penalty.
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.
