Approximation algorithms for parallel batch machine scheduling of malleable jobs

DOI10.1007/S10878-026-01391-XMaRDI QIDQ6845796zbMATH OpenFDO

Authors Fenghe Xia, Longkun Guo, Xiaoyan Zhang

Publication date 12 March 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01391-X

zbMATH Keywords

approximation algorithmcloud computingparallel batch schedulingparallelism degree

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A survey of scheduling with parallel batch (p-batch) processing
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Efficient approximation algorithms for scheduling moldable tasks
• Improved bounds for batch scheduling with nonidentical job sizes
• Logistics scheduling with batching and transportation
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling with batching: A review

This page was built for publication: Approximation algorithms for parallel batch machine scheduling of malleable jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845796)