Parallel Processing and Applied Mathematics

DOI10.1007/B97218zbMATH Open1128.90494OpenAlexW2984027331MaRDI QIDQ5307342FDOQ5307342

Klaus Jansen, Roberto Solis-Oba

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97218

Recommendations

• Approximation schemes for scheduling jobs with chain precedence constraints
• scientific article
• 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

zbMATH Keywords

constraintsschedulingchainsApproximation algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cited In (12)

• Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal
• Scheduling on unrelated machines under tree-like precedence constraints
• Title not available (Why is that?)
• A new approximation algorithm for UET-scheduling with chain-type precedence constraints.
• A monotone approximation algorithm for scheduling with precedence constraints
• Approximation schemes for scheduling jobs with chain precedence constraints
• Fast combination of scheduling chains under resource and time constraints
• Chains and trees: `Strong' -- `weak' order in job scheduling
• Scheduling of uniform parallel machines with s-precedence constraints
• Scheduling three chains on two parallel machines
• Title not available (Why is that?)
• Scheduling partially ordered jobs faster than \(2^n\)

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)