Minimizing maximum delivery completion time for order scheduling with rejection (Q830938)
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 7346751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing maximum delivery completion time for order scheduling with rejection |
scientific article; zbMATH DE number 7346751 |
Statements
Minimizing maximum delivery completion time for order scheduling with rejection (English)
0 references
10 May 2021
0 references
order scheduling
0 references
maximum delivery completion time
0 references
rejection
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8220130205154419
0 references
0.8206397294998169
0 references
0.8204761743545532
0 references
0.81623774766922
0 references
0.8134796023368835
0 references
