Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (Q5059343)
From MaRDI portal
scientific article; zbMATH DE number 7637130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem |
scientific article; zbMATH DE number 7637130 |
Statements
Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem (English)
0 references
23 December 2022
0 references
permutation flow shop
0 references
robust scheduling
0 references
uncertainty
0 references
min-max regret
0 references
directed graph
0 references
0 references
0 references
0 references
