Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (Q4671265)

From MaRDI portal
Revision as of 14:22, 8 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57185964, #quickstatements; #temporary_batch_1704715751507)
scientific article; zbMATH DE number 2161374
Language Label Description Also known as
English
Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
scientific article; zbMATH DE number 2161374

    Statements

    Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach (English)
    0 references
    0 references
    0 references
    26 April 2005
    0 references

    Identifiers