A Branch and Bound Algorithm for the Total Weighted Tardiness Problem (Q3682221): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.33.2.363 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2113856408 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch and Bound Algorithm for the Total Weighted Tardiness Problem |
scientific article |
Statements
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem (English)
0 references
1985
0 references
branch and bound algorithm
0 references
single machine
0 references
total weighted tardiness
0 references
Lagrangian relaxation
0 references
lower bounds
0 references
dominance rules
0 references
Computational experiments
0 references
