The time-optimal control problem for an arbitrary number of nonsynchronous oscillators with a limited scalar control is considered. An analytical investigation of the problem is performed. The property of strong accessibility and global controllability is proved, and a program control is found that brings the system from the origin to a fixed point in the shortest time. Trajectories satisfying both the motion equations of the system and the additional conditions based on the matrix nondegeneracy conditions of the relay control have been found for bringing a group of oscillators to the origin. Two classification methods of trajectories according to the number of control switchings are compared: the one based on the necessary extremum conditions and the Neustadt–Eaton numerical algorithm.