Bi-criteria scheduling on a single parallel-batch machine (Q437901)
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 6058805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bi-criteria scheduling on a single parallel-batch machine |
scientific article; zbMATH DE number 6058805 |
Statements
Bi-criteria scheduling on a single parallel-batch machine (English)
0 references
20 July 2012
0 references
bi-criteria scheduling
0 references
complexity
0 references
Pareto-optimal solution
0 references
fully polynomial-time approximation scheme
0 references
0 references
0.9553198
0 references
0.93020177
0 references
0.92178315
0 references
0.9116953
0 references
0.9095491
0 references
0.90874016
0 references
0.90757835
0 references
0.9073449
0 references
