An efficient new heuristic for the hoist scheduling problem (Q342278)

From MaRDI portal
Revision as of 23:59, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient new heuristic for the hoist scheduling problem
scientific article

    Statements

    An efficient new heuristic for the hoist scheduling problem (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation resources
    0 references
    dynamic scheduling
    0 references
    mixed integer linear programming (MILP)
    0 references
    heuristic
    0 references
    bounded processing times
    0 references
    initial products sequence
    0 references
    0 references