A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 2085779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm to minimize total weighted tardiness on a single processor |
scientific article; zbMATH DE number 2085779 |
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.9327115
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
