Single-machine scheduling to minimize absolute deviation of completion times from a common due date (Q3829339)
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 4104698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-machine scheduling to minimize absolute deviation of completion times from a common due date |
scientific article; zbMATH DE number 4104698 |
Statements
1989
0 references
single-machine n-job scheduling
0 references
sum of absolute lateness
0 references
common due date
0 references
branch-and-bound
0 references
Single-machine scheduling to minimize absolute deviation of completion times from a common due date (English)
0 references
0.8968479037284851
0 references
0.8871623277664185
0 references
0.8853000998497009
0 references
