In this paper, the authors present a self-organized approach for scheduling tasks on processors in embedded real-time systems. For such a mapping, two conflicting objectives have to be optimized: the reliability and the schedule length. Since the scheduling problem is NP-hard, a heuristic algorithm is used to produce schedules achieving different trade-offs between the two objectives. Moreover, a self-organization strategy based on dynamic crowding distance is adopted. This allows a better exploration of the objective space as well as an enhanced solution diversity. The proposed algorithm, reliability schedule length trad-offs algorithm (RSTA), is tested and compared with the popular SPEA2 algorithm where experimental results are promising on both quality and diversity of solutions.