A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (Q1302719)

From MaRDI portal
Revision as of 15:57, 26 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126643388, #quickstatements; #temporary_batch_1719410179150)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
scientific article

    Statements

    A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem (English)
    0 references
    0 references
    2 April 2001
    0 references
    0 references
    scheduling
    0 references
    branch-and-bound
    0 references
    Lagrangian relaxation
    0 references
    0 references