Prasad Tadepalli and Varad Joshi
In this paper we consider a simple model of real-time scheduling. W6 present a real-time scheduling system called RTS which is based on Korf’s Minimin algorithm. Experimental results show that the schedule quality initially improves with the amount of look-ahead search and tapers off quickly. So it appears that reasonably good schedules can be produced with a relatively shallow search.