Optimization of a recursive conveyor by reduction to a constraint satisfaction problem
type: Item
instance of: scholarly article
title: Optimization of a recursive conveyor by reduction to a constraint satisfaction problem
zbMATH Open document ID: 1481.90173
DOI: 10.1134/S0005117921110059
author: B. V. Kupriyanov
author: Alexander A. Lazarev
published in: Automation and Remote Control
publication date: 2022-01-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 7461108
zbMATH Keywords: scheduling theory
zbMATH Keywords: conveyor balancing
zbMATH Keywords: flow-shop problem
zbMATH Keywords: constraint satisfaction problem
MaRDI profile type: Publication
cites work: Assembly-Line Balancing by Linear Programming
cites work: Recent results on resource-constrained project scheduling with time windows: Models, solution methods, and applications
cites work: Optimization guided lower and upper bounds for the resource investment problem
cites work: Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
cites work: Robust optimization models for project scheduling with resource availability cost
cites work: Principles of Constraint Programming
cites work: Method of efficient analysis of the recursive conveyor process models
cites work: Q3291034
cites work: Consistency in networks of relations
cites work: Tree clustering for constraint networks
cites work: Closure properties of constraints
cites work: Estimation and optimization of the efficiency of a recursive conveyor
full work available at URL: s0005117921110059
OpenAlex ID: W4200278674
description: scientific article; zbMATH DE number 7461108