On decomposition of the total tardiness problem (Q1924615): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 15:20, 24 May 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
