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.
|Publication status||Published - 2002|