Augmentations of consistent partial orders for the one-machine total tardiness problem (Q1917355): 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: A survey of algorithms for the single machine total weighted tardiness scheduling problem / 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: Q3339651 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(95)00051-r / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160800316 / rank | |||
Normal rank | |||
Latest revision as of 12:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Augmentations of consistent partial orders for the one-machine total tardiness problem |
scientific article |
Statements
Augmentations of consistent partial orders for the one-machine total tardiness problem (English)
0 references
7 July 1996
0 references
one-machine scheduling
0 references
partial order on a job set
0 references
total tardiness
0 references
proper augmentations
0 references
Emmons' dominance theorem
0 references
