A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling (Q3983500)
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 26858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling |
scientific article; zbMATH DE number 26858 |
Statements
A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling (English)
0 references
27 June 1992
0 references
worst-case performance
0 references
shortest-processing-time
0 references
single machine scheduling
0 references
just-in-time production
0 references
0.8909659
0 references
0.8879993
0 references
0.8831491
0 references
0.8818775
0 references
0.8809092
0 references
0.88020647
0 references
0.8777957
0 references
0.87549704
0 references
