Pages that link to "Item:Q1600001"
From MaRDI portal
The following pages link to The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001):
Displaying 16 items.
- Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- On-line production order scheduling with preemption penalties (Q2385487) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)
