Abstract
In this note, we study a single-machine scheduling problem with deteriorating jobs whose processing times are an increasing function of their start times. The objective is to determine the optimal due-date and schedule simultaneously to minimize the total of due-date, earliness and tardiness penalties. We give a concise analysis of the problem and provide a polynomial time algorithm to solve the problem. Moreover, the algorithm can be easily applied to the ‘mirror’ scheduling problem in which the actual processing time of a job is a decreasing function of its starting time.
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.
