Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling |
scientific article |
Statements
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (English)
0 references
10 August 2011
0 references
assignment problem
0 references
scheduling
0 references
controllable processing times
0 references
complexity
0 references
resource allocation
0 references
bicriteria optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
