A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:49, 30 January 2024
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
