A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows (Q3163144)

From MaRDI portal
Revision as of 14:54, 2 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57185703, #quickstatements; #temporary_batch_1714653913616)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
scientific article

    Statements

    A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2010
    0 references
    0 references
    robotic cell
    0 references
    cyclic scheduling
    0 references
    processing time windows
    0 references
    method of prohibited intervals
    0 references
    branch and bound algorithm
    0 references
    0 references
    0 references