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 条
  • [31] On the Complexity of Finding a Potential Community
    Bazgan, Cristina
    Pontoizeau, Thomas
    Tuza, Zsolt
    ALGORITHMS AND COMPLEXITY (CIAC 2017), 2017, 10236 : 80 - 91
  • [32] Complexity of finding dense subgraphs
    Asahiro, Y
    Hassin, R
    Iwama, K
    DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 15 - 26
  • [33] On the complexity of finding emerging patterns
    Wang, LS
    Zhao, H
    Dong, GZ
    Li, JP
    PROCEEDINGS OF THE 28TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATION CONFERENCE, WORKSHOP AND FAST ABSTRACTS, 2004, : 126 - 129
  • [34] On the Complexity of Finding Tensor Ranks
    Aliabadi, Mohsen
    Friedland, Shmuel
    COMMUNICATIONS ON APPLIED MATHEMATICS AND COMPUTATION, 2021, 3 (02) : 281 - 289
  • [35] Needless waste
    A. Peters Reid
    British Dental Journal, 2010, 209 : 591 - 591
  • [36] NEEDLESS EXPOSURE
    STONE, S
    FIRE COMMAND, 1984, 51 (06): : 6 - 6
  • [37] Flood Key: increasing software keyboard keys by reducing needless ones without occultation
    Aulagner, Geoffroy
    Francois, Romain
    Martin, Benoit
    Michel, Dominique
    Raynal, Mathieu
    SELECTED TOPICS IN APPLIED COMPUTER SCIENCE, 2010, : 412 - 417
  • [38] NEEDLESS WASTE
    Reid, A. Peters
    BRITISH DENTAL JOURNAL, 2010, 209 (12) : 591 - 591
  • [39] NEEDLESS DIGOXIN
    不详
    LANCET, 1985, 2 (8463): : 1048 - 1048
  • [40] Needless Sacrifice
    Tihanyi, Gyula
    HISTORY TODAY, 2019, 69 (06) : 6 - 6