Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-013-0671-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964627392 / rank | |||
Normal rank | |||
Revision as of 00:06, 20 March 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
