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

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

Full description

Saved in:
Bibliographic Details
Published in:Automation and remote control 2021-11, Vol.82 (11), p.1892-1906
Main Authors: Kupriyanov, B. V., Lazarev, A. A.
Format: Article
Language:English
Subjects:
CAE) and Design
Calculus of Variations and Optimal Control
Optimization
Computer-Aided Engineering (CAD
Control
Conveyors
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Optimization
Recursive functions
Reduction
Renewable resources
Robotics
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117921110059