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

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 19:44, 5 March 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