A faster algorithm for the maximum weighted tardiness problem (Q916393): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the convex layers of a planar set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem / 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(90)90184-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980021811 / rank | |||
Normal rank | |||
Latest revision as of 09:43, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for the maximum weighted tardiness problem |
scientific article |
Statements
A faster algorithm for the maximum weighted tardiness problem (English)
0 references
1990
0 references
analysis of algorithms
0 references
convex hull
0 references
job scheduling
0 references
maximum weighted tardiness
0 references
