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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 13:39, 8 February 2024

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