Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches |
scientific article |
Statements
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (English)
0 references
22 June 2022
0 references
open shop scheduling
0 references
flow shop scheduling
0 references
complexity
0 references
approximation
0 references
