Precedence hyperstructures and graphs in assembly line design

Anastasia Taouktsoglou; Stefanos Spartalis

Precedence hyperstructures and graphs in assembly line design

Authors

Anastasia Taouktsoglou Democritus University of Thrace - Department of Production and Management Engineering
Stefanos Spartalis Democritus University of Thrace - Department of Production and Management Engineering

Keywords:

precedence graph, precedence partial hypergroupoid, process flow diagram, assembly line design, Fewer-Descendants-Vertex First algorithm (FDVF algorithm), More-Descendants-Vertex First algorithm (MDVF algorithm)

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.

Cover of n°53 Italian Journal of Pure and Applied Mathematics

Downloads

Published

2025-05-19

How to Cite

Taouktsoglou, A., & Spartalis, S. (2025). Precedence hyperstructures and graphs in assembly line design. Italian Journal of Pure and Applied Mathematics, 53, 166–184. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/5668