Abstract
The problem of optimal design of keyboards in which the various characters have to be allocated to given keys is stated as a Zero-One Quadratic Assignment Model. The solution depends on the joint probability distribution of the two-string combinations of the characters that describe the input data, and on key servicing time data which can be compiled from MTM standards. A first feasible solution can be derived from a linear assignment approximation. This approximation, when based on the existing estimates of the exact service times might be used as a low cost indicator whether the full optimization should be pursued.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have