Competitive online scheduling of perfectly malleable jobs with setup times
From MaRDI portal
Publication:2467259
DOI10.1016/j.ejor.2006.06.064zbMath1138.90395OpenAlexW2071698746MaRDI QIDQ2467259
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.064
Related Items
Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ Improved upper bounds for online malleable job scheduling ⋮ Efficient approximation algorithms for scheduling moldable tasks ⋮ Online malleable job scheduling for \(m\leq 3\) ⋮ An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ A survey of scheduling problems with setup times or costs ⋮ Cost-based decision-making in middleware virtualization environments ⋮ Online scheduling of malleable parallel jobs with setup times on two identical machines ⋮ Online scheduling of moldable parallel tasks ⋮ Online scheduling to minimize modified total tardiness with an availability constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic scheduling on parallel machines
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Optimal on-line scheduling of parallel jobs with dependencies
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- A survey of scheduling problems with setup times or costs
- Complexity of Scheduling Parallel Task Systems
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Application scheduling and processor allocation in multiprogrammed parallel processing systems
- On-line scheduling of parallel jobs
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
