Efficient approximation algorithms for parallel batch machine scheduling of malleable jobs

DOI10.1007/978-981-97-7798-3_5MaRDI QIDQ7405613zbMATH OpenFDO

Authors Fenghe Xia, Longkun Guo, Xiaoyan Zhang

Publication date 2024

Full work available at URL https://doi.org/10.1007/978-981-97-7798-3_5

zbMATH Keywords

approximation algorithmcloud computingparallel batch scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Cites work

• A survey of scheduling with parallel batch (p-batch) processing
• 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: Efficient 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 Q7405613)