Pages that link to "Item:Q614049"
From MaRDI portal
The following pages link to Competitive analysis of preemptive single-machine scheduling (Q614049):
Displaying 10 items.
- Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine (Q1402544) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
- Single parameter analysis of power of preemption on two and three uniform machines (Q2339808) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
- On-line Scheduling with a Monotonous Subsequence Constraint (Q4632214) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)
