A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness (Q864814)
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 5125251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness |
scientific article; zbMATH DE number 5125251 |
Statements
A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness (English)
0 references
13 February 2007
0 references
total tardiness
0 references
sequence-dependent setup
0 references
branch and bound
0 references
single machine schedule
0 references
0 references
0 references
0 references
0.9456260204315186
0 references
0.886071503162384
0 references
0.8708469867706299
0 references
0.8694672584533691
0 references
