A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (Q869149)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness |
scientific article; zbMATH DE number 5129913
| 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 maximum tardiness |
scientific article; zbMATH DE number 5129913 |
Statements
A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (English)
0 references
26 February 2007
0 references
combinatorial optimization
0 references
maximum 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.8851450085639954
0 references
0.8800833225250244
0 references
0.8587803840637207
0 references
