Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines

DOI10.1080/00207548408942426zbMATH Open0541.90056OpenAlexW2036481492MaRDI QIDQ3329205FDOQ3329205

Authors: Subhash C. Sarin, Salah E. Elmaghraby 

Publication date: 1984

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548408942426

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

zbMATH Keywords

heuristic proceduretotal weighted completion timesbounds on the worst-case performancem identical processors in parallelN unit jobs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal scheduling for two-processor systems
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Algoristics for Single-Machine Sequencing with Precedence Constraints

Cited In (1)

• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines

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)