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

DOI10.1134/S0005117921110059zbMath1481.90173OpenAlexW4200278674MaRDI QIDQ2069702

B. V. Kupriyanov, Alexander A. Lazarev

Publication date: 21 January 2022

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117921110059

zbMATH Keywords

scheduling theoryconstraint satisfaction problemflow-shop problemconveyor balancing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Estimation and optimization of the efficiency of a recursive conveyor
• Robust optimization models for project scheduling with resource availability cost
• Tree clustering for constraint networks
• Consistency in networks of relations
• Recent results on resource-constrained project scheduling with time windows: Models, solution methods, and applications
• Method of efficient analysis of the recursive conveyor process models
• Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
• Assembly-Line Balancing by Linear Programming
• Principles of Constraint Programming
• Closure properties of constraints
• Optimization guided lower and upper bounds for the resource investment problem

This page was built for publication: Optimization of a recursive conveyor by reduction to a constraint satisfaction problem