The emerging ubiquitous computing technology that belongs to the group of automatic identification technologies and has become popular is the Radio Frequency Identification System involving electromagnetic theory for identifying human beings, animals, and most importantly useful in various fields like drug discovery, tracking and distribution of various materials, and data warehouse management. In recent times, it is found that the ubiquitous technology has been extended to numerous industrial applications involving real-time decisions. This system termed as "networks of RFID systems" helps in controlling various parameters and systems in real-time environment. Scheduling of real-time systems is important since it helps in satisfying the timing constraints where tasks in real-time systems are decided on the basis of deadline, occurrence period and slack time. Few algorithms based on these criteria are Rate Monotonic (RM), Earliest Deadline First (EDF), and Least-Laxity-First (LLF) algorithms. EDF and LLF are considered to be dynamic in nature while RM is static in nature. To judge the efficiency of the algorithms two conditions like "overloaded" and "under loaded" are taken into consideration. In this article, an effort is made to combine the features of both static as well as dynamic algorithms. in order to control the real-time industrial processes. Hence the major issue of concern in this paper is to resolve two issues, one- determine the algorithm in terms of timing performance of different sub-processes so as to properly schedule them and other, how the timing constraints determine the behavior of the system need to be specified and thereby, to ensure that the algorithms meet the constraints under both overloaded and under loaded conditions.

RFID Real-time systems EDF LLF RM Laxity Success Rate