A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation
From MaRDI portal
Publication:953839
DOI10.1016/J.JSPI.2008.05.014zbMATH Open1284.62475OpenAlexW2091958406MaRDI QIDQ953839FDOQ953839
Authors: Jean-Jacques Garroi, P. Goos, K. Sörensen 
Publication date: 6 November 2008
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2008.05.014
Recommendations
- Efficient run orders for a two-factor response surface experiment on a correlated process
- An adjustment algorithm for optimal run orders in design of experiments
- (D T , C)-Optimal Run Orders
- Searching Optimal Designs in the Presence of Serially Correlated Errors
- Experimentation order in factorial designs: new findings
Cites Work
- The optimal design of blocked and split-plot experiments
- Error detecting and error correcting codes
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Variable neighborhood search
- Response surface methodology. Process and product optimization using designed experiments
- Title not available (Why is that?)
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- A variable neighborhood search for graph coloring.
- Budget constrained run orders in optimum design
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Randomized and random run order experiments
- Trend robust two-level factorial designs
- Some results on two-level factorial designs with dependent observations
- Some results on multi-level factorial designs with dependent obervations
- Title not available (Why is that?)
- Robust designs for serially correlated observations
- \((\mathcal D_t,C)\)-optimal run orders
Cited In (9)
- Variable neighbourhood search: Methods and applications
- Variable neighbourhood search: methods and applications
- A comparison of three-level orthogonal arrays in the presence of different correlation structures in observations
- (D T , C)-Optimal Run Orders
- Constructing Two-Level Designs by Concatenation of Strength-3 Orthogonal Arrays
- Construction of Two-Level Nonregular Designs of Strength Three With Large Run Sizes
- Quadrature Methods for Bayesian Optimal Design of Experiments With Nonnormal Prior Distributions
- Efficient run orders for a two-factor response surface experiment on a correlated process
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
This page was built for publication: A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953839)
