Feasibility problem of a class of discrete manufacturing process and its solution

Proposes the feasibility problem of a class of deterministic discrete manufacturing system, explores the operation behavior of such process on the basis of the concepts of partial order set, event graph, sequence matrix, and one-step-backward sequence matrix, develops an algorithm for finding out an optimum prone compatible row sequence matrix, and proves the tenability of the argument, and as such one solution to the problem is obtained