@ARTICLE{26583204_49986783_2012, author = {N. Dunichkina}, keywords = {, scheduling theory, dynamic programmingpareto-optimality}, title = {BI-criteria models and Pareto-optimal strategies synthesys algorithms of linear-distributed objects group}, journal = {}, year = {2012}, number = {1(19)}, pages = {17-23}, url = {https://bijournal.hse.ru/en/2012--1(19)/49986783.html}, publisher = {}, abstract = {Nadezhda Dunichkina - Postgraduate Student, Department of Informatics, Control Systems and Telecommunications, Faculty of Economics and Management, Volga State Academy of Water Transport (VGAVT).Address: 5a, Nesterova str., Nizhny Novgorod, 603005, Russian Federation.E-mail: nadezhda.dunichkina@gmail.comThe problem under study arose when it became necessary to establish computer systems supporting operational control of the diesel fuel supplies to the floating diesel-electric systems, performing river-bed mining of non-metallic construction materials in large-scale fluvial areas of inland waterways of the Russian Federation. During the navigation season a group of 15 - 20 units of floating extraction machines (FEMs) iworks in these areas. Diesel fuel supply processes of the FEMs are performed by specialized refueling tankers.The main objective of the dispatcher (a person responsible for decision-making) is to develop a supply strategy that minimizes the economic cost associated with non-productive downtime of the FEMs.This paper considers a mathematical model of one of the typical technological supply chains in which the FEMS are located in linear range with two identical tankers both moving in the same direction from the starting point along the range. The quality of the supply strategy is estimated by the values of two independent criteria that reflect certain losses caused by the strategy implementation. The choice of a particular pair of evaluation criteria depends on the operational situation on the planning horizon.In order to develop computer tools to solve the above decision making problems, we propose the algorithms of service strategies synthesis. These algorithms are based on Pareto concept and ideology of dynamic programming. The implementation of the algorithms is demonstrated by numerical examples. We provide the results of computational experiments which show that, for practically important dimensions of the considered models, the computational time is much less that the maximum limit allowed by the dispatcher’s specification  (15 minutes). This fact allows us to recommend applying of the models and algorithms proposed in the paper in the computer systems that support supply control of diesel fuel to the floating extraction machines operating in large-scale fluvial areas of inland waterways of Russia. A prototype of such system is well received in the experimental operation in the Kama cargo district of Kazan river port.}, annote = {Nadezhda Dunichkina - Postgraduate Student, Department of Informatics, Control Systems and Telecommunications, Faculty of Economics and Management, Volga State Academy of Water Transport (VGAVT).Address: 5a, Nesterova str., Nizhny Novgorod, 603005, Russian Federation.E-mail: nadezhda.dunichkina@gmail.comThe problem under study arose when it became necessary to establish computer systems supporting operational control of the diesel fuel supplies to the floating diesel-electric systems, performing river-bed mining of non-metallic construction materials in large-scale fluvial areas of inland waterways of the Russian Federation. During the navigation season a group of 15 - 20 units of floating extraction machines (FEMs) iworks in these areas. Diesel fuel supply processes of the FEMs are performed by specialized refueling tankers.The main objective of the dispatcher (a person responsible for decision-making) is to develop a supply strategy that minimizes the economic cost associated with non-productive downtime of the FEMs.This paper considers a mathematical model of one of the typical technological supply chains in which the FEMS are located in linear range with two identical tankers both moving in the same direction from the starting point along the range. The quality of the supply strategy is estimated by the values of two independent criteria that reflect certain losses caused by the strategy implementation. The choice of a particular pair of evaluation criteria depends on the operational situation on the planning horizon.In order to develop computer tools to solve the above decision making problems, we propose the algorithms of service strategies synthesis. These algorithms are based on Pareto concept and ideology of dynamic programming. The implementation of the algorithms is demonstrated by numerical examples. We provide the results of computational experiments which show that, for practically important dimensions of the considered models, the computational time is much less that the maximum limit allowed by the dispatcher’s specification  (15 minutes). This fact allows us to recommend applying of the models and algorithms proposed in the paper in the computer systems that support supply control of diesel fuel to the floating extraction machines operating in large-scale fluvial areas of inland waterways of Russia. A prototype of such system is well received in the experimental operation in the Kama cargo district of Kazan river port.} }