A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine (Q4943704)
From MaRDI portal
!
WARNING
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 1416930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine |
scientific article; zbMATH DE number 1416930 |
Statements
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine (English)
0 references
19 March 2000
0 references
on-line algorithm
0 references
single-machine scheduling
0 references
worst-case analysis
0 references
0.9131994843482972
0 references
0.9121999740600586
0 references
0.8952267169952393
0 references
0.8802425861358643
0 references
0.8740567564964294
0 references
