An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs (Q4883157)
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: An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs |
scientific article; zbMATH DE number 895000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs |
scientific article; zbMATH DE number 895000 |
Statements
1 July 1996
0 references
adjacent pairwise interchange algorithm
0 references
An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs (English)
0 references
0.9168463
0 references
0.8758584
0 references
0.87420845
0 references
0.87394273
0 references
0.86479205
0 references
0.86123514
0 references
0.85926706
0 references
