Competitive online scheduling of perfectly malleable jobs with setup times
From MaRDI portal
Publication:2467259
DOI10.1016/J.EJOR.2006.06.064zbMATH Open1138.90395OpenAlexW2071698746MaRDI QIDQ2467259FDOQ2467259
Authors: Jessen T. Havill, Weizhen Mao 
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
Recommendations
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Online malleable job scheduling for \(m\leq 3\)
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- Improved upper bounds for online malleable job scheduling
- Online scheduling of moldable parallel tasks
Cites Work
- A survey of scheduling problems with setup times or costs
- Title not available (Why is that?)
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Title not available (Why is that?)
- Complexity of Scheduling Parallel Task Systems
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Dynamic scheduling on parallel machines
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal on-line scheduling of parallel jobs with dependencies
- On-line scheduling of parallel jobs
- Application scheduling and processor allocation in multiprogrammed parallel processing systems
Cited In (13)
- Cost-based decision-making in middleware virtualization environments
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
- Improved competitive algorithms for online scheduling with partial job values
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Online scheduling of malleable parallel jobs
- Improved upper bounds for online malleable job scheduling
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Online scheduling to minimize modified total tardiness with an availability constraint
- Decentralized Online Scheduling of Malleable NP-hard Jobs
- A survey of scheduling problems with setup times or costs
- Online scheduling of moldable parallel tasks
- Online malleable job scheduling for \(m\leq 3\)
- Efficient approximation algorithms for scheduling moldable tasks
This page was built for publication: Competitive online scheduling of perfectly malleable jobs with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467259)
