Abstract
Recently, Pablo Sáez (2009) [1] has developed a quadratic algorithm for a 2-cyclic robotic scheduling problem. In this note we uncover that the algorithm handles a special version of the problem only and fails to solve the general 2-cyclic robotic scheduling problem.
Original language | English |
---|---|
Pages (from-to) | 5188-5190 |
Number of pages | 3 |
Journal | Theoretical Computer Science |
Volume | 410 |
Issue number | 47-49 |
DOIs | |
State | Published - 6 Nov 2009 |
Keywords
- Complexity
- No-wait
- Polynomial algorithm
- Robotic scheduling