A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670)
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 for the cyclic job-shop problem with transportation |
scientific article; zbMATH DE number 6651780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the cyclic job-shop problem with transportation |
scientific article; zbMATH DE number 6651780 |
Statements
A branch and bound algorithm for the cyclic job-shop problem with transportation (English)
0 references
11 November 2016
0 references
cyclic job-shop
0 references
transport
0 references
blocking
0 references
branch and bound
0 references
minimal cycle time
0 references
0 references
0 references
0.8155628442764282
0 references
0.757094144821167
0 references
0.7539935111999512
0 references
0.7500454783439636
0 references
0.7442086338996887
0 references
