Forming the Generations of New Technological Products as a Set Covering Problem
  • Проблемы Управления.
    на главную написать письмо карта сайта

    Forming the Generations of New Technological Products as a Set Covering Problem

    Barkalov, S.A., Burkov, V.N., Kurochka, P.N., and Serebryakova, E.A. Forming the Generations of New Technological Products as a Set Covering Problem

    Abstract. The development of any enterprise implies improving its control mechanisms for the manager to make decisions based on the achievements of science rather than intuitive ideas of his (or her) personal experience. It is necessary to improve the model-building process in order to eliminate the coinciding peaks of resource consumption when working on multiple projects. For this purpose, the concept of a generation of new technological products can be adopted: a new product is formed from separate prototypes (operating models), which can serve to determine some features of the project under development. Naturally, it is unreasonable to include the entire model range in the generation of new technological products: one should select the minimum number of prototypes required. This problem belongs to the class of set covering problems: complete covering (when the selected prototypes must possess the entire set of properties possessed by the model series under development) or partial covering (when the selected prototypes must possess only some of these properties). Exact algorithms and approximate heuristic algorithms are presented to solve both problems.

    Keywords: placement problem, complete set covering problem, partial set covering problem, innovation lifecycle, generation of new technological products, prototype, properties matrix.


    Cite this paper

    Barkalov, S.A., Burkov, V.N., Kurochka, P.N., and Serebryakova, E.A., Forming the Generations of New Technological Products as a Set Covering Problem. Control Sciences 6, 18–26 (2023). http://doi.org/10.25728/cs.2023.6.2

    Creative Commons License


    ИПУ РАН © 2007. Все права защищены