A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1023/B:ANOR.0000030680.29037.d0 / rank | |||
| Property / author | |||
| Property / author: Éric Pinson / rank | |||
| Property / author | |||
| Property / author: Éric Pinson / rank | |||
Normal rank | |||
| 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.1023/b:anor.0000030680.29037.d0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060676778 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1023/B:ANOR.0000030680.29037.D0 / rank | |||
Normal rank | |||
Latest revision as of 21:49, 9 December 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
