Abstract
We consider the problem of scheduling jobs with step-improving processing times around a common critical date on a single machine to minimize the makespan. For this problem, we present a simple linear time off-line approximation algorithm and prove its worst-case performance guarantee.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have