A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575)
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: A theoretical development for the total tardiness problem and its application in branch and bound algorithms |
scientific article; zbMATH DE number 6651731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A theoretical development for the total tardiness problem and its application in branch and bound algorithms |
scientific article; zbMATH DE number 6651731 |
Statements
A theoretical development for the total tardiness problem and its application in branch and bound algorithms (English)
0 references
11 November 2016
0 references
scheduling
0 references
single machine
0 references
total tardiness
0 references
branch and bound
0 references
0.8512532711029053
0 references
0.8363550305366516
0 references
0.8333296775817871
0 references
0.8327631950378418
0 references
