Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469)

From MaRDI portal
Revision as of 22:38, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
scientific article

    Statements

    Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (English)
    0 references
    0 references
    0 references
    14 December 2010
    0 references
    scheduling
    0 references
    flowshop
    0 references
    maximum lateness
    0 references
    random processing times
    0 references

    Identifiers