A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2012.04.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2012.04.008 / rank | |||
Normal rank | |||
Revision as of 00:08, 9 December 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
0 references
0 references
