Complexity of a scheduling problem with controllable processing times (Q969518)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of a scheduling problem with controllable processing times |
scientific article |
Statements
Complexity of a scheduling problem with controllable processing times (English)
0 references
7 May 2010
0 references
total weighted completion time
0 references
controllable processing time
0 references
single machine
0 references
NP-hard
0 references
