Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211): Difference between revisions
From MaRDI portal
Latest revision as of 11:53, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two-dedicated-machine scheduling problem with precedence relations to minimize makespan |
scientific article |
Statements
Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (English)
0 references
30 April 2014
0 references
parallel machine scheduling
0 references
complexity
0 references
assembly line balancing
0 references
0 references