The complexity of scheduling job families about a common due date (Q1376265)
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: The complexity of scheduling job families about a common due date |
scientific article; zbMATH DE number 1097568
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of scheduling job families about a common due date |
scientific article; zbMATH DE number 1097568 |
Statements
The complexity of scheduling job families about a common due date (English)
0 references
17 December 1997
0 references
nonregular performance measure
0 references
family scheduling
0 references
setup time structure
0 references
parallel machines
0 references
common due-date
0 references
complexity results
0 references
total earliness/tardiness problem
0 references
0 references
0 references
0 references
