Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241)

From MaRDI portal
Revision as of 22:52, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
scientific article

    Statements

    Branch less, cut more and minimize the number of late equal-length jobs on identical machines (English)
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    polynomial-time algorithm
    0 references
    solution tree
    0 references
    scheduling identical machines
    0 references
    0 references