The following pages link to (Q4779156):
Displaying 6 items.
- Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
- A better lower bound for on-line scheduling (Q1327292) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- SPT is optimally competitive for uniprocessor flow (Q2390257) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)