We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a … study, we show that the case with a fixed number of forbidden intervals can be solved by a pseudo-polynomial time algorithm …, while no polynomial time approximation algorithm with a fixed performance ratio exists for the case with two forbidden …