A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718)

From MaRDI portal
Revision as of 23:58, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7271631
Language Label Description Also known as
English
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
scientific article; zbMATH DE number 7271631

    Statements

    A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2020
    0 references
    prize-collecting
    0 references
    single-machine scheduling
    0 references
    integer linear programming
    0 references
    branch and bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references