A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:49, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete 4-parametric complexity classification of short shop scheduling problems |
scientific article |
Statements
A complete 4-parametric complexity classification of short shop scheduling problems (English)
0 references
5 February 2014
0 references
shop scheduling
0 references
makespan minimization
0 references
complexity classification
0 references
