The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single parameter analysis of power of preemption on two and three uniform machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tight lower bound for the best-\(\alpha\) algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comment on scheduling on uniform machines under chain-type precedence constraints / rank | |||
Normal rank | |||
Latest revision as of 21:03, 17 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The benefit of preemption for single machine scheduling so as to minimize total weighted completion time |
scientific article |
Statements
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (English)
0 references
15 January 2019
0 references
scheduling
0 references
preemptive schedule
0 references
release dates
0 references
power of preemption
0 references
