Information diffusion game model for a divisional seru design in seru system with non-preemptive discrete stations
针对单元生产系统中的分区式单元设计问题，提出基于无向图的信息扩散博弈模型，证明纯纳什均衡存在性，并通过仿真实验表明该设计相比替代策略平均吞吐量提升21.13%，尤其适用于工位处理时间高度可变的情形。
Seru production is a human-centered, flexible manufacturing system well-suited to rapid market changes. In this paper, we investigate how to design a high-performance divisional seru within a Seru system considering non-preemptive and discrete stations. We begin by identifying the key factors of a seru and develop an Information Diffusion Game (IDG) model based on undirected graphs. We establish the existence of a pure Nash equilibrium (PNE) and demonstrate its implications for workload balance among workers. To evaluate performance, we conduct simulation experiments and compare the throughput of seru configured under the PNE design with that of cellular bucket brigades. The results show that the PNE-based design achieves an average throughput improvement of 21.13 percent relative to alternative strategies, with particularly strong performance when station processing times are highly variable. This research addresses a critical gap in the micro-level design of seru systems and provides a theoretical foundation for investigating the design of other seru configurations.