An approximation scheme for rejection-allowed single-machine rescheduling

•Consider a rescheduling problem on a single machine in response to job delays.•Resource constrained where both the job rejection cost and the job tardiness are upperbounded.•Explore structural properties of some optimal reschedules and design a pseudo-polynomial time. exact algorithm•When the job rejection cost is unbounded, develop a fully polynomial time approximation scheme.