An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints |
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
27 June 2022
0 references
combinatorial optimization
0 references
one-machine scheduling
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
