Pages that link to "Item:Q2467259"
From MaRDI portal
The following pages link to Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259):
Displaying 10 items.
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- Online malleable job scheduling for \(m\leq 3\) (Q1944031) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines (Q3455878) (← links)
- Efficient approximation algorithms for scheduling moldable tasks (Q6113310) (← links)
