Question: what is np hard scheduling problems?
Answer: The class of all polynomially solvable problems is called class P. Another class of optimisation problems is known as NP-hard problems. For such problems, no polynomial-time algorithms are known and it is generally believed that these problems cannot be solved in polynomial time.