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 02:47, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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