A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.03.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077748110 / rank | |||
Normal rank | |||
Revision as of 21:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case |
scientific article |
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
