An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478)

From MaRDI portal
Revision as of 22:40, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7548827
Language Label Description Also known as
English
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints
scientific article; zbMATH DE number 7548827

    Statements

    An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    one-machine scheduling
    0 references
    branch-and-bound
    0 references
    0 references