A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235)
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 5238700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times |
scientific article; zbMATH DE number 5238700 |
Statements
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (English)
0 references
22 February 2008
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8615898489952087
0 references
0.8607680797576904
0 references
0.8040413856506348
0 references
0.7988086938858032
0 references
