Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (Q5953167)
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 1691141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates |
scientific article; zbMATH DE number 1691141 |
Statements
Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (English)
0 references
2001
0 references
scheduling
0 references
common due date
0 references
benchmark
0 references
0 references
0 references
0 references
0 references
0 references
0.8031930327415466
0 references
0.7912976741790771
0 references
0.7912238836288452
0 references
0.7890352010726929
0 references
