Minimizing total tardiness on parallel machines with preemptions (Q2434279): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-010-0198-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000325475 / rank | |||
Normal rank | |||
Revision as of 23:38, 19 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
