| Article ID: | iaor20083024 |
| Country: | United Kingdom |
| Volume: | 34 |
| Issue: | 8 |
| Start Page Number: | 2396 |
| End Page Number: | 2402 |
| Publication Date: | Aug 2007 |
| Journal: | Computers and Operations Research |
| Authors: | Cheng T.C. Edwin, He Yong, Ji Min |
| Keywords: | heuristics |
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.