Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074)
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-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time |
scientific article; zbMATH DE number 6546619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time |
scientific article; zbMATH DE number 6546619 |
Statements
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (English)
0 references
26 February 2016
0 references
identical machines
0 references
delivery coordination
0 references
assignable delivery times
0 references
approximation algorithm
0 references
polynomial-time approximation scheme
0 references
0 references
0 references
0 references
0 references
0.8788731694221497
0 references
0.8439796566963196
0 references
0.8108972907066345
0 references
0.8103067278862
0 references
0.8056092858314514
0 references
