This manuscript addresses the problem of process scheduling in a multitasking computing environment. The mainstream feedback-based approach to that problem preserves the existing scheduler, and adapts some of its parameters by means of convenient loops. On the contrary, in this research, the scheduler is entirely replaced by suitable control structures, synthesised and analysed in the discrete-time domain. The proposed approach allows for a clear interpretability of the involved parameters, whereas the complexity of the obtained scheduling solutions is comparable to the existing ones. Simulation examples support the above claims. The focus is here restricted for convenience to the preemptive single-processor case, although several generalisations are possible.