Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746)
From MaRDI portal
scientific article; zbMATH DE number 7703051
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion |
scientific article; zbMATH DE number 7703051 |
Statements
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (English)
0 references
27 June 2023
0 references
scheduling
0 references
worst-case complexity
0 references
flowshop
0 references
inclusion-exclusion
0 references
0 references
0 references
0 references
0 references
