A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

DOI10.1016/J.DAM.2008.03.025MaRDI QIDQ1003678zbMATH OpenOpenAlexFDO

Authors Vladimir Kats, Eugene Levner

Publication date 4 March 2009

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2008.03.025

zbMATH Keywords

complexitypolynomial-time algorithmscyclic schedulingEuler formularobotic schedulingno-wait condition

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• A polynomial algorithm for 2-degree cyclic robot scheduling
• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A faster polynomial algorithm for 2-cyclic robotic scheduling
• Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Cites work

• scientific article; zbMATH DE number 3214146 (Why is no real title available?)
• scientific article; zbMATH DE number 3200170 (Why is no real title available?)
• A faster polynomial algorithm for 2-cyclic robotic scheduling
• A polynomial algorithm for 2-degree cyclic robot scheduling
• A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Cyclic scheduling in 3-machine robotic flow shops
• Cyclic scheduling in a robotic production line
• Cyclic scheduling in robotic flowshops
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Robotic cell scheduling with operational flexibility
• Scheduling no-wait robotic cells with two and three machines
• Sequencing and scheduling in robotic cells: recent developments
• Throughput optimization in robotic cells

Cited in

(12)

• Cyclic scheduling in robotic flowshops with bounded work-in-process levels
• Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
• Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
• A faster polynomial algorithm for 2-cyclic robotic scheduling
• A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem
• Cyclic scheduling in a robotic production line
• A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
• A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
• A polynomial algorithm for 2-degree cyclic robot scheduling
• A quadratic algorithm for the 2-cyclic robotic scheduling problem
• Parametric algorithms for 2-cyclic robot scheduling with interval processing times
• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell

This page was built for publication: A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

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