We have proposed a new framework and a policy for online scheduling based on critical cumulative delay. We have also applied the cumulative delay based scheduling policy to typical shop scheduling models. This paper extends our previous work to parallel machines environments and we here concentrate to investigate an analytical model to determine a suitable value of 'critical cumulative delay', which triggers schedule modification when a cumulative task delay exceeds it a time point. Some computational experiments demonstrate the applicability of the proposed model.