Синтез ограниченных по структуре оптимально-компромиссных стратегий обслуживания потока объектов

Abstract

In this paper a model of single-phase service of deterministic objects flow is discussed. A bicriteria problem of service policies synthesis is formulated. It is shown that if restrictions on service policies structure are imposed the problem will become non NP-hard and it will be possible to design a polynomial algorithm for Pareto-optimal service policies synthesis. Example is introduced. Refs.: 8 titles.