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 the normal view instead:
scientific article; zbMATH DE number 7548827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8816969990730286
0 references
0.8810165524482727
0 references
0.8328992128372192
0 references
