Adaptibility and limitations of the enumerating method

Abstract

Nowadays there are a lot of scheduling algorithms which are able to solve different scheduling problems. But the efficiency of these methods is doubtful, because the methods are unable to answer the question, how far is the solution from the optimal solution in the case of Makespan. Only the enumeration can answer the above mentioned question. Enumeration is an NP-hard task, but we can improve its efficiency through parallel processing.