RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2021 Issue 11, Pages 75–93 (Mi at15829)

This article is cited in 1 paper

Topical issue (end)

Optimization of a recursive conveyor by reduction to a constraint satisfaction problem

B. V. Kupriyanov, A. A. Lazarev

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, 117997 Russia

Abstract: 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.

Keywords: scheduling theory, conveyor balancing, flow-shop problem, constraint satisfaction problem.


Received: 25.01.2021
Revised: 21.06.2021
Accepted: 30.06.2021

DOI: 10.31857/S0005231021110052


 English version:
Automation and Remote Control, 2021, 82:11, 1892–1906

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025