A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6651780 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cyclic job-shop | |||
| Property / zbMATH Keywords: cyclic job-shop / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
transport | |||
| Property / zbMATH Keywords: transport / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
blocking | |||
| Property / zbMATH Keywords: blocking / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch and bound | |||
| Property / zbMATH Keywords: branch and bound / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal cycle time | |||
| Property / zbMATH Keywords: minimal cycle time / rank | |||
Normal rank | |||
Revision as of 05:54, 28 June 2023
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
