Optimizing energy consumption of robotic cells by a branch \& bound algorithm

DOI10.1016/J.COR.2018.09.012zbMath1458.90264OpenAlexW2893061539MaRDI QIDQ1628117

Libor Bukata, Zdeněk Hanzálek, Přemysl Šucha

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.09.012

zbMATH Keywords

parallel algorithmsindustrial robotsconvex envelopesenergy optimizationrobotic cellsbranch \& bound algorithmIndustry 4.0

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10)

Related Items (2)

Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint ⋮ A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace

Uses Software

• likwid

Cites Work

• A cyclic scheduling problem with an undetermined number of parallel identical processors
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells
• Solving knapsack problems on GPU
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• Throughput optimization in robotic cells
• The resource-constrained modulo scheduling problem: an experimental study

This page was built for publication: Optimizing energy consumption of robotic cells by a branch \& bound algorithm