Planning of assembly sequences is essential to the manufacturing system design process. An algorithm is presented in this paper to generate a precedence relation qwesentatiion for mechanical assembly sequences fmn the AND/OR graph represenlatian. The equivalence of the two representation is established. The real time property for the resulting set of precedence relations is also defined and discussed. It is shown that the comm and completeness of a represenration can not guarantee the real time property.