Minimizing the weighted number of tardy task units (Q1329790): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3680271 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing mean weighted execution time loss on identical and uniform processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the number of tardy job units under release time constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single Machine Scheduling to Minimize Total Late Work / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for Scheduling Imprecise Computations with Timing Constraints / rank | |||
Normal rank | |||
Latest revision as of 17:08, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the weighted number of tardy task units |
scientific article |
Statements
Minimizing the weighted number of tardy task units (English)
0 references
31 July 1994
0 references
preemptive schedule
0 references
feasible schedule
0 references
imprecise computation
0 references
tardy task
0 references
