Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:08, 7 February 2024
scientific article; zbMATH DE number 7000357
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
