An approximate method of exceptions on the basis of solving the problem of minimum coverage. Method exceptions works much faster than the known best practices, it can be used as a planning tool for resource allocation in systems where the planning is done in real time with the problem dimension (N < 300, M < 60). At the same time it allows to use in getting timely results at a level of efficiency index p (T)> 0.9. Experimentally proved that the error of the algorithm does not exceed 4-5% and decreases with increasing dimension of the problem being solved.
multicore processor, the problem of the minimal coverage, timeliness of the task resource allocation, time complexity, linear programming