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

DOI10.1080/00207548408942426zbMath0541.90056OpenAlexW2036481492MaRDI QIDQ3329205

Sarin, Subhash C., 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

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)

Related Items

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

Cites Work

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