This journal article deals with the problem of real-time scheduling of operating systems (OS) tasks by a hybrid genetic-based scheduling algorithm. Indeed, most of real-time systems are framed with aid of priority-based scheduling algorithms. Nevertheless, when such a scenario is applied to save the system at the occurrence of hardware-software faults, or to improve its performance, some real-time properties can be violated at run-time. In contrast, most of the applications of real-time systems are based on timing constraints, i.e. OS tasks should be scheduled properly to finish their execution within the time specified by the real-time systems. For this reason, the authors propose in their article, a hybrid genetic-based scheduling approach that automatically checks the systems feasibility after any reconfiguration scenario was applied to an embedded system. A benchmark example is given, and the experimental results demonstrate the effectiveness of the originally proposed genetic-based scheduling approach over other such classical genetic algorithmic approaches.