Abstract
In many real life applications, jobs deteriorate at a certain rate while waiting to be processed. This paper introduces a new deterioration model where the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position. We show that the single-machine makespan minimization problem remains polynomially solvable under the proposed model. We also show that an optimal schedule of the total completion time minimization problem is polynomially solvable under some cases and-shaped with respect to job deterioration rates for other cases.
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.
