67455

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

Optimization of a Recursive Conveyor by Reduction to a Constraint Satisfaction Problem

ISBN/ISSN: 

0005-1179

DOI: 

10.1134/S0005117921110059

Наименование источника: 

  • Automation and Remote Control

Обозначение и номер тома: 

Vol. 82, No. 11

Город: 

  • Moscow

Издательство: 

  • Pleiades Publishing, Ltd.

Год издания: 

2021

Страницы: 

1892-1906
Аннотация
We consider the recursive conveyor schedule optimization problem. To this end, we introduce the definition of a conveyor described by a connected acyclic graph, in which each vertex is an operation or a control function associated with the corresponding recursive function from a certain finite set. Each recursive function defines a precedence relation for a conveyor operation. The solution of the problem of minimizing the time of order fulfillment by a conveyor on a finite set of renewable resources is considered. The solution is carried out by reduction to the constraint satisfaction problem.

Библиографическая ссылка: 

Куприянов Б.В., Лазарев А.А. Optimization of a Recursive Conveyor by Reduction to a Constraint Satisfaction Problem // Automation and Remote Control. 2021. Vol. 82, No. 11. С. 1892-1906.