Synthesis of service policies of binary objects flow by a stationary service processor with a storage element

The mathematical model of binary deterministic objects flow service in a uniprocessor system with a storage element is considered in the paper. The model gives an adequate specific description of mass water-transport control processes such as goods deliveries to the Northern Territories. The efficiency of service policy is assessed by two independent criteria. An algorithm for the optimal-compromise service policies synthesis has been designed. The algorithm works under Pareto optimization concept, and realizes the ideology of dynamic programming. Numerical examples showing the realisation technology of the offered algorithm, and results of its approbation on test data sets are given.