Information Technology Journal1812-56381812-5646Asian Network for Scientific Information10.3923/itj.2002.153.159Mahmood, A.2200212Many time critical applications require predictable performance and tasks in these applications have to meet their deadlines. Hence, tasks in these applications need to be scheduled in such a manner that they not only meet their deadlines but also satisfy some performance criteria specific to the application domain. Scheduling real-time tasks with minimum jitter in a distributed computing environment is particularly important in many control applications. This problem is known to be NP-hard, even for simple cases. Therefore, heuristic approaches seem appropriate to these classes of problems. In this paper, we investigate a tabu search algorithm for nonpreemptive static scheduling of real-time tasks where tasks are periodic and have arbitrary deadlines, precedence and exclusion constraints. The proposed algorithm not only creates a feasible schedule but it also minimizes jitter for periodic tasks. The performance of the algorithm has been studied through a simulation and the results are reported in this paper.]]>Burns, B.I., A. Mc-Dermid and J.A. Vickers,1996Burns, A., A.J. Wellings, C.M. Bailey and E. Fyfe,1993Carpenter, T., K. Driscoll, K. Hoyme and J. Carciofini,1994Fohler, G.,1994Glover, F.,1990Hou, E.S., N. Ansari and H. Ren,1994Hubscher, R. and F. Glover,1996Kidwell, M.D. and D.J. Cook,1994Manimaran, G. and C.S.R. Murthy,1998Mahmood, A.,2000Di Natale, M. and J.A. Stankovic,2000Porto, A.S.C.S. and A.C.C. Ribeiro,1995Ramamritham, K., J.A. Stankovic and P.F. Shiah,1990Stankovic, J.A., K. Ramamritham and S. Cheng,1985Tindell, K.W., A. Burns and A.J. Wellings,1992Xu, J. and D. Parnas,1990Kim, Y.C. and Y.S. Hong,1993