An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GitHub / rank | |||
Normal rank | |||
Revision as of 20:42, 29 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
27 June 2022
0 references
combinatorial optimization
0 references
one-machine scheduling
0 references
branch-and-bound
0 references
