Minimizing total tardiness on parallel machines with preemptions (Q2434279): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57633844, #quickstatements; #temporary_batch_1707252663060 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:10, 5 March 2024
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
