No label defined (Q4396115)

Assembly Line Balancing (ALB) problem is considered. The ALB process is a sort of discrete industrial processes, i.e., a collection of time- and space- constraint operations under the condition of indivisibility of particular operations performance. The problem is to group the assembly operations into minimal number of subsets, which form work places on the assembly line, when the sum of operation durations is limited. Also the optimal ALB meets the criterion of the minimization of the unused work time. The author suggests to model ALB problem with the aid of multi-person dynamic hierarchical games with coalition structure. Brief owerview of the theory of such games is given, including various information aspects and hypotheses, for example, 1) dynamic games with a priori information and a priori choise of the strategies, 2) dynamic games with post-stage information and post-stage choise of the strategies, 3) dynamic games with a priori information and post-stage choise of the strategies. The theory is not applied to the ALB problem; but a hierarchical game associated with ALB problem is constructed. In the game, the central player (the top of hierarchy) has the objective function of ALB problem. This fictitious player controls the information structure. Other players correspond to operations and choose the coalitions, i.e., the subset of operations, to form a work place at every time stage. The coalition local objective is to minimize the unused work time. Additional details of the game in context of ALB left unclear. An example of ALB problem is considered. In the conclusion the author declares perspectives of the aforesaid approach to solve ALB problems.