A new method is proposed to judge the feasibility of a schedule. Here, the no-buffer scheduling problem is targeted because of its complexity due to the consideration of the blocking of machines. The proposed method focuses on the problem where the operation orders of machines axe given in advance, which is a simple linear programming. By adopting the two-phase method, the feasibility judgement of this problem can be performed.