Two-machine flowshop scheduling problem with coupled-operations (Q2327688): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129475786, #quickstatements; #temporary_batch_1726341741784 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-018-2967-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-018-2967-Z / rank | |||
Normal rank | |||
Latest revision as of 00:46, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flowshop scheduling problem with coupled-operations |
scientific article |
Statements
Two-machine flowshop scheduling problem with coupled-operations (English)
0 references
15 October 2019
0 references
flowshop
0 references
coupled-operations
0 references
complexity
0 references
polynomial time algorithms
0 references
0 references
0 references
