A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519)

From MaRDI portal
Revision as of 14:20, 22 May 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
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
scientific article

    Statements

    A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 1994
    0 references
    0 references
    heuristic
    0 references
    identical parallel machines
    0 references
    makespan
    0 references
    near-optimal solutions
    0 references
    0 references