A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033)

From MaRDI portal
Revision as of 22:41, 2 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
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
scientific article

    Statements

    A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (English)
    0 references
    0 references
    11 June 2010
    0 references
    0 references
    scheduling
    0 references
    batch processing machine
    0 references
    makespan
    0 references
    column generation
    0 references
    branch and price
    0 references
    0 references
    0 references
    0 references