A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4818873 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A supermodular relaxation for scheduling with release dates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5501838 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3217922 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3995531 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing average completion time in the presence of release dates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria / rank | |||
Normal rank | |||
Latest revision as of 13:41, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 1. 47-approximation for a preemptive single-machine scheduling problem |
scientific article |
Statements
A 1. 47-approximation for a preemptive single-machine scheduling problem (English)
0 references
4 September 2000
0 references
analysis of algorithms
0 references
suboptimal algorithms
0 references
production/scheduling
0 references
approximations/heuristic
0 references
single-machine deterministic scheduling
0 references
0 references
