Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem |
scientific article |
Statements
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (English)
0 references
17 October 2005
0 references
scheduling
0 references
one-machine
0 references
branch-and-bound
0 references
hard instances
0 references
0 references
0 references
0 references
