A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time (Q3737197): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:39, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time |
scientific article |
Statements
A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time (English)
0 references
1985
0 references
single machine sequencing
0 references
precedence constraints
0 references
sum of weighted completion times
0 references
branch and bound
0 references
lower bound
0 references
Lagrangean relaxation
0 references
Lagrange multipliers
0 references
cost reduction method
0 references
Computational results
0 references
