On decomposition of the total tardiness problem (Q1924615): Difference between revisions
From MaRDI portal
Added link to MaRDI 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 / cites work | |||
| Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4124332 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(95)00027-h / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170188992 / rank | |||
Normal rank | |||
Latest revision as of 10:57, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On decomposition of the total tardiness problem |
scientific article |
Statements
On decomposition of the total tardiness problem (English)
0 references
20 October 1996
0 references
backward shift
0 references
one-machine total tardiness problem
0 references
decomposition algorithm
0 references
