Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness |
scientific article; zbMATH DE number 1319525
| 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; zbMATH DE number 1319525 |
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
