No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957)

From MaRDI portal
Revision as of 21:50, 13 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129894466, #quickstatements; #temporary_batch_1726260318586)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
scientific article

    Statements

    No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 October 2019
    0 references
    no-idle/no-wait shop scheduling
    0 references
    dominoes
    0 references
    Eulerian path
    0 references
    Hamiltonian path
    0 references
    numerical matching with target sums
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references