Pages that link to "Item:Q632670"
From MaRDI portal
The following pages link to A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell (Q632670):
Displaying 14 items.
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance (Q337088) (← links)
- Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization (Q342414) (← links)
- A faster polynomial algorithm for 2-cyclic robotic scheduling (Q880563) (← links)
- A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678) (← links)
- A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem (Q1034640) (← links)
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots (Q1042101) (← links)
- A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots (Q1265862) (← links)
- Minimizing the number of robots to meet a given cyclic schedule (Q1357782) (← links)
- A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling (Q1382807) (← links)
- Static force capability optimization of humanoids robots based on modified self-adaptive differential evolution (Q1652338) (← links)
- A dynamic scheduling approach for optimizing the material handling operations in a robotic cell (Q1654361) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- A polynomial algorithm for 2-degree cyclic robot scheduling (Q1869423) (← links)
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
