.png){kind=icon}
.png){kind=icon}
Return
Some comments on sequencing with controllable processing times
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-001-1441-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
scheduling
sequencing
controllable processing time
single machine
computational complexity
bicriterion optimization