Minimizing Total Tardiness on a Single Machine with Precedence Constraints (Q4025912)
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 124262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing Total Tardiness on a Single Machine with Precedence Constraints |
scientific article; zbMATH DE number 124262 |
Statements
Minimizing Total Tardiness on a Single Machine with Precedence Constraints (English)
0 references
18 February 1993
0 references
minimizing total tardiness
0 references
unit-processing-time jobs
0 references
single machine
0 references
NP-hard
0 references
tree-structured precedence constraints
0 references
polynomial-time algorithm
0 references
0.8847280740737915
0 references
0.8635637164115906
0 references
0.8353747725486755
0 references
0.8216122984886169
0 references
