An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3938812 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maintenance of configurations in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On general routing problems / rank | |||
Normal rank |
Latest revision as of 14:19, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem |
scientific article |
Statements
An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (English)
0 references
1989
0 references
analysis of algorithms
0 references
sequential processing
0 references
data structures
0 references