A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839)
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 variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation |
scientific article; zbMATH DE number 5363133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation |
scientific article; zbMATH DE number 5363133 |
Statements
A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (English)
0 references
6 November 2008
0 references
AR(1)
0 references
autocorrelation
0 references
central composite design
0 references
D-optimality criterion
0 references
local search
0 references
time trend
0 references
0 references
0 references
0 references
0 references
0 references
0.8284193277359009
0 references
0.8201839923858643
0 references
0.8201839923858643
0 references
0.7753759026527405
0 references
0.76579749584198
0 references
