Approximation algorithms for scheduling with resource and precedence constraints
From MaRDI portal
Recommendations
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Scheduling on unrelated machines under tree-like precedence constraints
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- scientific article; zbMATH DE number 1187165
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Cites work
- Approximation algorithms for shop scheduling problems with minsum objective
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Bounds for Certain Multiprocessing Anomalies
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Conditional hardness of precedence constrained scheduling on identical machines
- scientific article; zbMATH DE number 6472635 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Towards tight lower bounds for scheduling problems
Cited in
(19)- Approximate solution of a resource-constrained scheduling problem
- Resource cost aware scheduling
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- Scheduling of tasks with effectiveness precedence constraints
- Scheduling on unrelated machines under tree-like precedence constraints
- A kind of resource-constrained scheduling problem with chains precedence constraints
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Approximate Deadline-Scheduling with Precedence Constraints
- scientific article; zbMATH DE number 2086932 (Why is no real title available?)
- Quasi-PTAS for scheduling with precedences using LP hierarchies
- Parallel Processing and Applied Mathematics
- scientific article; zbMATH DE number 5260973 (Why is no real title available?)
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- scientific article; zbMATH DE number 7650890 (Why is no real title available?)
- A unified approach to approximating resource allocation and scheduling
- Approximation algorithms for scheduling with reservations
- A bi-objective unrelated parallel machine scheduling problem with additional resources and soft precedence constraints
- Fast combination of scheduling chains under resource and time constraints
- A monotone approximation algorithm for scheduling with precedence constraints
This page was built for publication: Approximation algorithms for scheduling with resource and precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304123)
