A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884)
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 method for the job-shop problem with sequence-dependent setup times |
scientific article; zbMATH DE number 5320609
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound method for the job-shop problem with sequence-dependent setup times |
scientific article; zbMATH DE number 5320609 |
Statements
A branch and bound method for the job-shop problem with sequence-dependent setup times (English)
0 references
3 September 2008
0 references
job-shop scheduling
0 references
sequence-dependent setup times
0 references
branch and bound
0 references
constraint propagation
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
