Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827)

From MaRDI portal
Revision as of 15:35, 12 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128288129, #quickstatements; #temporary_batch_1723473115199)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
scientific article

    Statements

    Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2019
    0 references
    batch processing machine
    0 references
    heuristics
    0 references
    maximum lateness
    0 references
    lower bound
    0 references
    job families
    0 references

    Identifiers