Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have