A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449): Difference between revisions
From MaRDI portal
Latest revision as of 19:37, 4 April 2025
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch and bound algorithm to minimize total weighted tardiness on a single processor |
scientific article |
Statements
A branch and bound algorithm to minimize total weighted tardiness on a single processor (English)
0 references
10 August 2004
0 references
scheduling
0 references
Lagrangian decomposition
0 references
branch and bound
0 references
0.95100003
0 references
0.9304891
0 references
0.92847097
0 references
0.9237168
0 references
0.9236297
0 references
0.9146486
0 references
0.9101522
0 references