Approximation bounds for a general class of precedence constrained parallel machine scheduling problems
From MaRDI portal
Recommendations
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Stochastic Machine Scheduling with Precedence Constraints
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
Cited in
(34)- Improved bounds on relaxations of a parallel machine scheduling problem
- List scheduling in a parallel machine environment with precedence constraints and setup times
- Approximation algorithms for shop scheduling problems with minsum objective
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Lower bounds on precedence-constrained scheduling for parallel processors.
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- Makespan minimization with OR-precedence constraints
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Designing PTASs for MIN-SUM scheduling problems
- Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
- Conditional hardness of precedence constrained scheduling on identical machines
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems
- Hardness of precedence constrained scheduling on identical machines
- Decomposition algorithm for the single machine scheduling polytope
- Optimal restricted due date assignment in scheduling
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
- Approximation algorithms for scheduling with resource and precedence constraints
- Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- The Loading Time Scheduling Problem
- Parallel machine covering with limited number of preemptions
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
- An improved approximation algorithm for scheduling under arborescence precedence constraints
- Non-Clairvoyant Precedence Constrained Scheduling.
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- A note on the precedence-constrained class sequencing problem
- On a parallel machine scheduling problem with precedence constraints
This page was built for publication: Approximation bounds for a general class of precedence constrained parallel machine scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840372)
