| Article ID: | iaor2003513 |
| Country: | Austria |
| Volume: | 68 |
| Issue: | 2 |
| Start Page Number: | 181 |
| End Page Number: | 192 |
| Publication Date: | Jan 2002 |
| Journal: | Computing |
| Authors: | Woeginger G.J., Hoogeveen H. |
We discuss sequencing problems on a single machine with controllable job processing times. For the maximum job cost criterion, we present several polynomial time results. For the total weighted job completion time criterion, we present an NP-hardness result. Our results settle several open questions in this area.