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 the normal view instead:
scientific article; zbMATH DE number 1097568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8689695596694946
0 references
0.8158023953437805
0 references
0.8149697184562683
0 references
0.8144443035125732
0 references
