Parametric algorithms for 2-cyclic robot scheduling with interval processing times

DOI10.1007/s10951-010-0166-0zbMath1222.90017OpenAlexW2057755863MaRDI QIDQ640307

Eugene Levner, Vladimir Kats

Publication date: 18 October 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-010-0166-0

zbMATH Keywords

polynomial modelsefficient algorithmsbinary searchcyclic schedulinggraph-theoretic modelsrobotic scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times, Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint

Cites Work

• Unnamed Item
• Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
• Sequencing and scheduling in robotic cells: recent developments
• A faster polynomial algorithm for 2-cyclic robotic scheduling
• Identical part production in cyclic robotic cells: Concepts, overview and open questions
• A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
• A parametric critical path problem and an application for cyclic scheduling
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Cyclic scheduling in a robotic production line
• Complexity of one-cycle robotic flow-shops
• Cyclic scheduling in robotic flowshops
• Cycles and permutations in robotic cells
• A polynomial algorithm for 2-degree cyclic robot scheduling
• Throughput optimization in robotic cells
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints