Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130)
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: Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits |
scientific article; zbMATH DE number 7856502
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits |
scientific article; zbMATH DE number 7856502 |
Statements
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (English)
0 references
30 May 2024
0 references
bicriteria scheduling
0 references
flowshop
0 references
makespan
0 references
total completion time
0 references
approximation algorithm
0 references
inapproximability
0 references
0 references
0 references
0 references
0 references
