A best on-line algorithm for single machine scheduling with small delivery times (Q2481972)
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: A best on-line algorithm for single machine scheduling with small delivery times |
scientific article; zbMATH DE number 5264282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A best on-line algorithm for single machine scheduling with small delivery times |
scientific article; zbMATH DE number 5264282 |
Statements
A best on-line algorithm for single machine scheduling with small delivery times (English)
0 references
15 April 2008
0 references
scheduling
0 references
on-line algorithm
0 references
single machine
0 references
delivery time
0 references
0 references
0 references
0.9177990555763244
0 references
0.9121999740600586
0 references
0.8914341330528259
0 references
0.8822836875915527
0 references
