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
 
Set OpenAlex properties.
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2020.0988 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100759455 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 22:40, 19 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
    0 references