A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:37, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the cyclic job-shop problem with transportation |
scientific article |
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
