Abstract
In this paper, we consider uniform machine scheduling problem with deteriorating jobs and rejection. Each job's processing time is a linear nondecreasing function of its starting time. A job can be rejected by paying a penalty cost. The objective is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. We propose a fully polynomial-time approximation scheme (FPTAS), which shows that the problem is NP-hard in the ordinary sense.
Sign-in/Register to access full text options 
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.
