A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case |
scientific article; zbMATH DE number 5523161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case |
scientific article; zbMATH DE number 5523161 |
Statements
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (English)
0 references
4 March 2009
0 references
cyclic scheduling
0 references
robotic scheduling
0 references
polynomial-time algorithms
0 references
complexity
0 references
no-wait condition
0 references
Euler formula
0 references
