Several Panwheel schedulers have been reported preuaously for schedulang real-tame systems an whach the temporal dastances between consecutave executaons of tasks must be less than thear respectzve dastance constraants. The scheduler Sr has been used for task sets wzth real number dastance constraants and executaon tames. Sr transforms the dastance constraants an a system znto harmonic values wath a base of 2. In thas paper, we present a panwheel scheduler Srb whach as deraued from Sr usang any base greater than or equal to 2. The schedulabzlaty condataon of Srb as presented and zls optamalaty as proved. We also study the performance of Srb by samulataon and compare at wath a near-optamal heurastac algorathm HSr.