Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091)
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 2214940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem |
scientific article; zbMATH DE number 2214940 |
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
0.89605165
0 references
0.89409816
0 references
0.8869288
0 references
0.8799596
0 references
0.8793857
0 references
0.8773386
0 references
0.8699414
0 references
0.86875075
0 references
0.8683442
0 references
