Approximation and Online Algorithms
From MaRDI portal
Publication:5898474
Recommendations
- Real-time scheduling of linear speedup parallel tasks
- Linear time algorithms for parallel machine scheduling
- Algorithmic Applications in Management
- Parallel machine scheduling with linearly decreasing processing times
- Approximation algorithms for scheduling parallel jobs
- Scheduling parallelizable jobs online to maximize throughput
- Scheduling fully parallel jobs with integer parallel units
- On speed scaling scheduling of parallel jobs with preemption
- Parallel machine scheduling with speed-up resources
- On-line scheduling of parallel jobs
Cited in
(13)- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- Approximation of the parallel machine scheduling problem with additional unit resources
- Scheduling under linear constraints
- Machine scheduling with resource dependent processing times
- Approximation algorithms for parallel machine scheduling with speed-up resources
- Approximation algorithms for scheduling on multi-core processor with shared speedup resources
- Scheduling jobs with time-resource tradeoff via nonlinear programming
- Scheduling parallel dedicated machines with the speeding-up resource
- A log-linear \((2 +5/6)\)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
- Parallel machine scheduling with speed-up resources
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
This page was built for publication: Approximation and Online Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898474)
