Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling |
scientific article; zbMATH DE number 5937806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling |
scientific article; zbMATH DE number 5937806 |
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
0.8614826798439026
0 references
0.8108723759651184
0 references
0.7921130061149597
0 references
0.7909767031669617
0 references
