Parallel Processing and Applied Mathematics
From MaRDI portal
Publication:5307342
Recommendations
- Approximation schemes for scheduling jobs with chain precedence constraints
- scientific article; zbMATH DE number 1187166
- Approximation algorithms for scheduling with resource and precedence constraints
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Scheduling identical jobs with chain precedence constraints on two uniform machines
Cited in
(14)- Scheduling of uniform parallel machines with s-precedence constraints
- Chains and trees: `Strong' -- `weak' order in job scheduling
- Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal
- scientific article; zbMATH DE number 5669900 (Why is no real title available?)
- A monotone approximation algorithm for scheduling with precedence constraints
- Fast combination of scheduling chains under resource and time constraints
- Approximation schemes for scheduling jobs with chain precedence constraints
- Scheduling on unrelated machines under tree-like precedence constraints
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- Scheduling three chains on two parallel machines
- scientific article; zbMATH DE number 1187166 (Why is no real title available?)
- A kind of resource-constrained scheduling problem with chains precedence constraints
- Scheduling partially ordered jobs faster than \(2^n\)
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints.
This page was built for publication: Parallel Processing and Applied Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307342)
