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

DOI10.1007/S10951-010-0166-0MaRDI QIDQ640307zbMATH OpenOpenAlexFDO

Authors Vladimir Kats, Eugene Levner

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

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

Recommendations

• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
• A polynomial algorithm for 2-degree cyclic robot scheduling
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Cyclic scheduling in a robotic production line

Cites work

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

Cited in

(8)

• Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint
• Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity
• Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem
• A faster polynomial algorithm for 2-cyclic robotic scheduling
• A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints

This page was built for publication: Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640307)