A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case (Q1003678)

From MaRDI portal
Revision as of 20:54, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references