A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem
From MaRDI portal
(Redirected from Publication:1034640)
Recommendations
- A quadratic algorithm for the 2-cyclic robotic scheduling problem
- A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
- A polynomial algorithm for 2-degree cyclic robot scheduling
- A faster polynomial algorithm for 2-cyclic robotic scheduling
- Parametric algorithms for 2-cyclic robot scheduling with interval processing times
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
- A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
- Optimal Cyclic Scheduling Of A Robotic Processing Line With Two-Product And Time-Window Constraints
- Cyclic scheduling of a 2-machine robotic cell with tooling constraints
Cites work
Cited in
(4)- A quadratic algorithm for the 2-cyclic robotic scheduling problem
- Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity
- Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling
- A faster polynomial algorithm for 2-cyclic robotic scheduling
This page was built for publication: A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034640)