The complex method for definition of effective decisions on data set composition and shedule for their processing in conveyor systems
Authors: Кротов К.В. 
Published: October 2021

Построение комплексных расписаний обработки партий данных предполагает формирование взаимосвязанных решений по составам партий и расписаниям их обработки. В результате выполненной декомпозиции обобщенной задачи построения расписаний обработки партий ее решение представляется в виде решений двух подзадач — определения составов партий и непосредственно расписаний. В рассмотрение введена модель двухуровневого программирования для определения эффективных решений по составам партий и расписаниям их обработки. Для нахождения эффективных решений выполнено обоснование методов определения составов партий и расписаний. Проведены исследования особенностей обработки партий в конвейерных системах с точки зрения входных параметров, характеризующих обрабатываемые данные и конвейерную систему.
The task of controlling the pipelined processing for various types of remote sensing data of the Earth is important. The task of managing the data processing process is complex and represents a set of two interrelated subtasks — the definition of the composition of batches and the schedules of their processing. The complex task of managing the processing of data lots is represented in the form of hierarchy of the required subtasks. The realization of effective decisions on the composition of parties is realized at the top level, schedules and their processing — on the lower level. A hierarchical game model (two-level programming) for determining solutions at the appropriate levels is accordingly designed. The final time for processing all data entering the system is considered as a criterion at the upper level (to determine the composition of data lots). The total downtiming of the pipeline segments when processing batches of data is the criterion at the lower level. Local optimization methods are proposed at each level of the hierarchy to determine effective solutions. The method for determining solutions by party composition provides for the search for a better solution in the vicinity of different types of the current locally optimal solution. The approaches of making decisions on the composition of parties in the
vicinity of the respective species are formulated. The proof of both theorems determining the conditions for the end of the change in the composition of a given number of batches
and that eliminates duplication of solutions in a certain neighborhood is accomplished. A generalized algorithm for determining locally optimal solutions by party composition,
acting on the upper level of the hierarchy, is formulated based on these methods.The algorithm for determining effective schedules is based on “greedy” strategies and involves adding each new batch to the processing sequences optimized in the previous steps and determining an effective position for them in this order. Software implementation of the developed methods of local optimization of solutions at each level of the hierarchy is completed. Studies for the dependence of the effectiveness of the proposed methods (in particular, the method of forming batches of batches) on the parameters of the system and the data processed are carried out. The obtained results have shown that use of the offered method of the definition of batches allows considerable reducing for the time of processing of batches of the data in the conveyor
system. The efficiency of the treatment is then increased by 10% to 80 %.