Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
From MaRDI portal
Publication:4238532
Recommendations
Cited in
(39)- Power-aware scheduling for makespan and flow
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
- On-line scheduling with precedence constraints
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Makespan minimization with OR-precedence constraints
- Scheduling on unrelated machines under tree-like precedence constraints
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
- Conditional hardness of precedence constrained scheduling on identical machines
- Hardness of precedence constrained scheduling on identical machines
- Optimal restricted due date assignment in scheduling
- Approximation algorithms for scheduling with resource and precedence constraints
- Towards tight lower bounds for scheduling problems
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- scientific article; zbMATH DE number 1187165 (Why is no real title available?)
- scientific article; zbMATH DE number 1187166 (Why is no real title available?)
- An improved monotone algorithm for scheduling related machines with precedence constraints
- The Loading Time Scheduling Problem
- Min-sum scheduling under precedence constraints
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
- An improved approximation algorithm for scheduling under arborescence precedence constraints
- Non-Clairvoyant Precedence Constrained Scheduling.
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Approximation schemes for scheduling jobs with chain precedence constraints
- Parallel Processing and Applied Mathematics
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Related machine scheduling with machine speeds satisfying linear constraints
- Related machine scheduling with machine speeds satisfying linear constraints
- Approximation algorithms for multiprocessor scheduling under uncertainty
- Scheduling of uniform parallel machines with s-precedence constraints
- Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
- Communication-aware scheduling of precedence-constrained tasks on related machines
- An efficient PTAS for stochastic load balancing with Poisson jobs
- A flow shop scheduling problem with machine-dependent speeds: an ensemble approach with worst-case analysis
- On the price of heterogeneity in parallel systems
- Scheduling algorithms for procrastinators
- Speed scaling of tasks with precedence constraints
- A monotone approximation algorithm for scheduling with precedence constraints
This page was built for publication: Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238532)
