Pages that link to "Item:Q1003678"
From MaRDI portal
The following pages link to A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678):
Displaying 7 items.
- Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization (Q342414) (← links)
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times (Q617517) (← links)
- A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell (Q632670) (← links)
- Parametric algorithms for 2-cyclic robot scheduling with interval processing times (Q640307) (← links)
- A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem (Q1034640) (← links)
- Cyclic scheduling in robotic flowshops with bounded work-in-process levels (Q2994797) (← links)
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows (Q3163144) (← links)