Precedence hyperstructures and graphs in assembly line design

Abstract

In this paper we introduce the precedence hyperoperation, which constructs a precedence partial hypergroupoid, i.e. a partial hypergroupoid with some special properties. Given a precedence partial hypergroupoid, a precedence graph can be defined and vice versa. Using the precedence partial hypergroupoid of a precedence graph and the Fewer-Descendants-Vertex First algorithm (FDVF algorithm), a process flow diagram is created, which can be used in mixed-model assembly line design.