Approximation schemes for robust makespan scheduling problems (Q2806953)
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: Approximation schemes for robust makespan scheduling problems |
scientific article; zbMATH DE number 6582542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation schemes for robust makespan scheduling problems |
scientific article; zbMATH DE number 6582542 |
Statements
Approximation Schemes for Robust Makespan Scheduling Problems (English)
0 references
19 May 2016
0 references
flow shop scheduling
0 references
polynomial optimization
0 references
0.8560183644294739
0 references
0.854243814945221
0 references
0.8481419086456299
0 references
0.8411994576454163
0 references
0.8401604890823364
0 references
