Abstract
An algorithm is presented for the construction of efficient neighbour designs for use in field variety trials. The method is based on a two-stage procedure whereby a desirable α;-array is obtained first, and then indexed to produce a neighbour array. Three schemes for allocating weights to plots within a block are compared.
Original language | English |
---|---|
Pages (from-to) | 871-876 |
Number of pages | 6 |
Journal | Biometrika |
Volume | 74 |
Issue number | 4 |
DOIs | |
Publication status | Published - Dec 1987 |
Externally published | Yes |