Two-agent scheduling in a flowshop (Q322895)
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: Two-agent scheduling in a flowshop |
scientific article; zbMATH DE number 6636226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent scheduling in a flowshop |
scientific article; zbMATH DE number 6636226 |
Statements
Two-agent scheduling in a flowshop (English)
0 references
7 October 2016
0 references
scheduling
0 references
competitive agents
0 references
flowshop
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.8953512907028198
0 references
0.8803269863128662
0 references
0.8704864978790283
0 references
0.8639829158782959
0 references
0.8637711405754089
0 references
