Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds (Q4645931)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7000357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds |
scientific article; zbMATH DE number 7000357 |
Statements
Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (English)
0 references
11 January 2019
0 references
approximation algorithm
0 references
completion time
0 references
parallel machine
0 references
single machine
0 references
flow shop
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9225658178329468
0 references
0.8906558752059937
0 references
