A simple linear time algorithm for scheduling with step-improving processing times (Q869002)
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 simple linear time algorithm for scheduling with step-improving processing times |
scientific article; zbMATH DE number 5129825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple linear time algorithm for scheduling with step-improving processing times |
scientific article; zbMATH DE number 5129825 |
Statements
A simple linear time algorithm for scheduling with step-improving processing times (English)
0 references
26 February 2007
0 references
scheduling
0 references
approximation algorithm
0 references
worst-case ratio
0 references
0.9241055846214294
0 references
0.8169848322868347
0 references
0.8131955862045288
0 references
0.8070337772369385
0 references
0.8048166036605835
0 references
