Abstract
AbstractWe study a single machine scheduling problem with the total weighted late work and the total rejection cost. The late work of a job is the part of this job executed after its due date, and the rejection cost of a job is the fee of rejecting to process it. We consider a Pareto scheduling and two restricted scheduling problems. The Pareto scheduling problem aims to find all non‐dominated values of the total weighted late work and the total rejection cost. The restricted scheduling problems are dedicated to minimizing the total weighted late work with the total rejection cost not greater than a given threshold, and minimizing the total rejection cost with the total weighted late work not greater than a given threshold, respectively. For the Pareto scheduling problem, we prove that it is binary NP‐hard by providing a pseudo‐polynomial time algorithm, and give a fully polynomial time approximation scheme (FPTAS). For the restricted scheduling problems, we prove that there are no FPTASes unless , which answers an open problem. Moreover, we develop relaxed FPTASes for these two restricted scheduling problems.
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 callSimilar Papers
Disclaimer: 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.
