Minimizing the total weighted completion time in the relocation problem (Q964872)
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: Minimizing the total weighted completion time in the relocation problem |
scientific article; zbMATH DE number 5696514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the total weighted completion time in the relocation problem |
scientific article; zbMATH DE number 5696514 |
Statements
Minimizing the total weighted completion time in the relocation problem (English)
0 references
21 April 2010
0 references
relocation problem
0 references
resource-constrained scheduling
0 references
NP-hardness
0 references
approximation algorithm
0 references
0.8991507291793823
0 references
0.8524870872497559
0 references
0.8507673740386963
0 references
0.8284041285514832
0 references
