Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-61310-2_23 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1960330418 / rank | |||
Normal rank | |||
Revision as of 23:43, 19 March 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
