Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125)

From MaRDI portal
Revision as of 12:08, 9 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
Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
scientific article

    Statements

    Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (English)
    0 references
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    batch processing machines
    0 references
    non-identical job sizes
    0 references
    job shop
    0 references
    approximation algorithm
    0 references

    Identifiers