An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system (Q3553742)
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 approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system |
scientific article; zbMATH DE number 5696526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system |
scientific article; zbMATH DE number 5696526 |
Statements
An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system (English)
0 references
21 April 2010
0 references
fluid models
0 references
0 references
0 references
0 references
0 references
0.782736599445343
0 references
0.7787322402000427
0 references
0.7692367434501648
0 references
0.7603230476379395
0 references
0.7549188733100891
0 references
