Finding and reducing needless complexity

被引:3
|
作者
Olson, Eric [1 ]
Reger, Sara [1 ]
Singer, David [1 ]
机构
[1] IBM Corp, Armonk, NY 10504 USA
关键词
Complexity theory; Process management;
D O I
10.1108/10748121011021001
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
Purpose - The purpose of this paper is to present a structure for identifying complexity that is not needed in an enterprise, and describe a methodology for eliminating it. Whether it is process complexity, product complexity, or organizational complexity, investments in managing higher levels of complexity often offer businesses significant value by enabling them to offer more and better products and services to a broader range of customers. However, along with higher levels of complexity has come an increased requirement to distinguish between that complexity which is needed and that which is needless. Design/methodology/approach - This paper first presents a structure for categorizing different kinds of complexity, with a detailed focus on needless complexity that is categorized into four types. Next, specific factors are developed that can be used to identify needless complexity in an organization. Finally, a methodology is presented that organizations can utilize in order to eliminate needless complexity. Findings - Needless complexity can be created where it never should have existed in the first place, and other times needless complexity exists as an historical relic left over from a time when it actually was needed. Using a structured approach, needless complexity can be identified and eliminated to yield significant business benefits. Originality/value - This paper provides a framework for differentiating needless complexity from needed complexity, and assessing the landscape of needless complexity in an organization. It also provides an approach for identifying opportunities to reduce needless complexity using the needless complexity diagnostic.
引用
收藏
页码:53 / +
页数:10
相关论文
共 50 条
  • [21] On the complexity of finding emerging patterns
    Wang, LS
    Zhao, H
    Dong, GZ
    Li, JP
    THEORETICAL COMPUTER SCIENCE, 2005, 335 (01) : 15 - 27
  • [22] The Query Complexity of Witness Finding
    Akinori Kawachi
    Benjamin Rossman
    Osamu Watanabe
    Theory of Computing Systems, 2017, 61 : 305 - 321
  • [23] On the Complexity of Finding Tensor Ranks
    Mohsen Aliabadi
    Shmuel Friedland
    Communications on Applied Mathematics and Computation, 2021, 3 : 281 - 289
  • [24] On the Complexity of Finding Narrow Proofs
    Berkholz, Christoph
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 351 - 360
  • [25] ON THE COMPLEXITY OF FINDING A SUN IN A GRAPH
    Hoang, Chinh T.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 23 (04) : 2156 - 2162
  • [26] The Query Complexity of Witness Finding
    Kawachi, Akinori
    Rossman, Benjamin
    Watanabe, Osamu
    THEORY OF COMPUTING SYSTEMS, 2017, 61 (02) : 305 - 321
  • [27] Galectinomics: finding themes in complexity
    Cooper, DNW
    BIOCHIMICA ET BIOPHYSICA ACTA-GENERAL SUBJECTS, 2002, 1572 (2-3): : 209 - 231
  • [28] COMPLEXITY OF FINDING ALPHABET INDEXING
    SHIMOZONO, S
    MIYANO, S
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (01) : 13 - 18
  • [29] THE COMPLEXITY OF FINDING ARBORESCENCES IN HYPERGRAPHS
    WOEGINGER, GJ
    INFORMATION PROCESSING LETTERS, 1992, 44 (03) : 161 - 164
  • [30] The NISQ Complexity of Collision Finding
    Hamoudi, Yassine
    Liu, Qipeng
    Sinha, Makrand
    ADVANCES IN CRYPTOLOGY, PT IV, EUROCRYPT 2024, 2024, 14654 : 3 - 32