A generalized model for obtaining an optimal level of forming relations between multi-members in a pyramid organization structure

  • Authors:

  • Kiyoshi Sawada

  • Affiliations:

  • Department of Information and Management Science, University of Marketing and Distribution Sciences, Kobe, Japan

  • Venue:
  • ICOSSSE '09 Proceedings of the 8th WSEAS international conference on System science and simulation in engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This paper proposes a model of adding relations to a pyramid organization structure which is a complete K-ary tree of height H. When edges between every pair of P(P = 2, 3,...,K) nodes with the same depth N are added, an optimal set of P nodes with an optimal depth N* is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes. Moreover, an optimal pair (N, P)* which maximizes the total shortening path length per a node of P nodes is shown.