We consider performance of open multiclass queueing networks under general scheduling policies. Two linear program (LP) performance bounds are compared, the achievable region method and the approximate linear program with quadratic approximation architecture. The latter is shown to give tighter upper and lower bounds.