We consider a scheduling rule called MBPS, the mean bounded priority scheduling, which prioritizes jobs by an index computed for each job as a weighed sum of the proportion of time it has been processed and the proportion of time it has been waiting for processing. Proof that MBPS is a deteriorating or a delaying jobs single-machine scheduling problems is given. Two expressions of this dynamic priority are interpreted as a net-reduction in the processing of a job and a delay caused or a time to repair a breakdown respectively. As to the behavior of this scheduling scheme, two results are established. MBPS is shown to be a deterioration function yielding an index policy.