Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for common due date scheduling problems with interval data and minmax regret criterion |
scientific article |
Statements
Complexity results for common due date scheduling problems with interval data and minmax regret criterion (English)
0 references
20 June 2019
0 references
scheduling
0 references
minmax regret
0 references
number of late jobs
0 references
approximation algorithms
0 references
robust optimization
0 references
0 references
0 references
0 references
0 references
0 references
