Competitive online scheduling of perfectly malleable jobs with setup times
From MaRDI portal
(Redirected from Publication:2467259)
Recommendations
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Online malleable job scheduling for m 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 \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- A survey of scheduling problems with setup times or costs
- Application scheduling and processor allocation in multiprogrammed parallel processing systems
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Complexity of Scheduling Parallel Task Systems
- Dynamic scheduling on parallel machines
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 576164 (Why is no real title available?)
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- scientific article; zbMATH DE number 1863269 (Why is no real title available?)
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- On-line scheduling of parallel jobs
- Optimal on-line scheduling of parallel jobs with dependencies
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
Cited in
(13)- Online scheduling to minimize modified total tardiness with an availability constraint
- Improved competitive algorithms for online scheduling with partial job values
- Online malleable job scheduling for m 3
- Online scheduling of moldable parallel tasks
- A survey of scheduling problems with setup times or costs
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- Online scheduling of malleable parallel jobs
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Cost-based decision-making in middleware virtualization environments
- Efficient approximation algorithms for scheduling moldable tasks
- Decentralized Online Scheduling of Malleable NP-hard Jobs
- Improved upper bounds for online malleable job scheduling
- Online scheduling of malleable parallel jobs with setup times on two identical machines
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)
