Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness |
scientific article |
Statements
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (English)
0 references
29 November 1999
0 references
parallel machine scheduling
0 references
due date assignment
0 references
