Algorithmic Generation of Feasible System Architectures,

Abstract

A methodology is presented for generating decision making organizational structures that satisfy some given requirements. Allowable interactions between organizational members are first defined and constraints are introduced. To find the set of structures that satisfy the requirements, a methodology has been designed that reduces the computational complexity of the problem and makes it tractable. The set of structures is delimited by its maximal and minimal elements and a technique is given to generate the entire set from its boundaries. Simple paths are introduced as the incremental unit leading from an organization to its neighboring ones. Lattice theory is used throughout the methodology as the underlying analytical tool.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1988
Accession Number
ADA191722

Entities

People

  • Alexander H. Levis
  • Pascal A. Remy

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computers
  • Decomposition
  • Environment
  • Formal Languages
  • Inclusions
  • Inequalities
  • Information Processing
  • Language
  • Mathematics
  • Organizational Structure
  • Personal Computers
  • Petri Nets

Fields of Study

  • Engineering

Readers

  • Neural Network Machine Learning.
  • Systems Analysis and Design