Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
From MaRDI portal
Publication:3329205
Recommendations
- Scheduling preemptive jobs with precedence constraints on parallel machines
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
- Heuristic procedures for parallel-machine scheduling problems with stochastic precedence constraints
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines
- Precedence constrained parallel-machine scheduling of position-dependent jobs
- scientific article; zbMATH DE number 1187165
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Cites work
- Algoristics for Single-Machine Sequencing with Precedence Constraints
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Optimal scheduling for two-processor systems
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
Cited in
(1)
This page was built for publication: Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329205)