A Clustering Algorithm for Computer‐Assisted Process Organization
扩展了一个基于群体成员交互的数学规划聚类模型，加入顺序关系、组大小和时间限制，用于计算机辅助流程组织中的结构化设计，并给出了高效算法和计算结果。
ABSTRACT Amathematical programming clustering model that forms groups based on total group membership interactions is extended to include precedence relationships, group size limits, and group time limits. The extended clustering model is most appropriate for structured design of information systems as described by the computer‐assisted process organization (CAPO), which requires certain ordering and may have limits on development and production capacity. An efficient algorithm for optimizing the CAPO criteria along with computational results is presented. The results show that the method is viable for the CAPO problems reported in the literature.