| Article ID: | iaor20062079 |
| Country: | China |
| Volume: | 33 |
| Issue: | 2 |
| Start Page Number: | 148 |
| End Page Number: | 151 |
| Publication Date: | Apr 2005 |
| Journal: | Journal of Fuzhou University |
| Authors: | Xie Jinshan |
The optimal design for a kind of sequencing problem of N-set is investigated, and the least substitution time of the converse ordinal of N-set is obtained. At the same time the relevant results and realization of the algorithm will appear too.