A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951)

From MaRDI portal
Revision as of 20:22, 10 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-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
scientific article

    Statements

    A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2015
    0 references
    0 references
    scheduling
    0 references
    single-machine
    0 references
    tardiness
    0 references
    learning effect
    0 references
    0 references
    0 references
    0 references