How to prove that a problem is NP complete?

Question

I have problem with scheduling. I need to prove that the problem is NP complete. What can be the methods to prove it NP complete?

Answer 1

First, you show that it lies in NP at all.

Then you find another problem that you already know is NP complete and show how you polynomially reduce NP Hard problem to your problem.