The Embedded systems are resource limited systems and commonly response time is one of the most important requirements. As the most important parts of real-time embedded operating systems, scheduling algorithms are presented to improve the real-time of the embedded systems. The most existing real-time scheduling algorithms are based on the processes with little consideration about the resources in the systems. In this paper, we propose a novel real-time scheduling algorithm for real-time embedded system. This algorithm is based on the requirements for resources of different tasks and all possible tasks scheduling sequences will be computed as preparation and stored as a table. Our scheduling algorithm will use this table for scheduling.