Minimizing total tardiness on parallel machines with preemptions (Q2434279)
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: Minimizing total tardiness on parallel machines with preemptions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total tardiness on parallel machines with preemptions |
scientific article |
Statements
Minimizing total tardiness on parallel machines with preemptions (English)
0 references
5 February 2014
0 references
parallel machines
0 references
total tardiness
0 references
preemptive problems
0 references
linear programming
0 references
polynomial algorithm
0 references
NP-hardness
0 references
