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 the normal view instead:
scientific article; zbMATH DE number 5523161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9041325449943542
0 references
0.8893925547599792
0 references
0.8888147473335266
0 references
0.8724302649497986
0 references
0.8657567501068115
0 references
