A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685)

From MaRDI portal
Revision as of 15:34, 5 June 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 to minimize the number of late jobs on a single machine with release time constraints
scientific article

    Statements

    A branch and bound to minimize the number of late jobs on a single machine with release time constraints (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2003
    0 references
    0 references
    Single machine scheduling
    0 references
    number of late jobs
    0 references
    branch and bound
    0 references
    dominance properties
    0 references
    elimination rules
    0 references
    0 references
    0 references
    0 references