Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607)
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: Preemptive scheduling of two uniform parallel machines to minimize total tardiness |
scientific article; zbMATH DE number 6066906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive scheduling of two uniform parallel machines to minimize total tardiness |
scientific article; zbMATH DE number 6066906 |
Statements
Preemptive scheduling of two uniform parallel machines to minimize total tardiness (English)
0 references
16 August 2012
0 references
scheduling
0 references
uniform machines
0 references
total tardiness
0 references
polynomial algorithm
0 references
0 references
0 references
0 references
0.9053767919540404
0 references
0.8941540718078613
0 references
0.8848865032196045
0 references
0.860265851020813
0 references
