Approximation schemes for scheduling a batching machine with nonidentical job size

DOI10.1007/s11424-007-9057-7zbMath1147.68012OpenAlexW1987221073MaRDI QIDQ2425843

Xianzhao Zhang, Zhigang Cao, Zengxia Cai, Yu-Zhong Zhang

Publication date: 7 May 2008

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-007-9057-7

zbMATH Keywords

sizeapproximation schemebatching machineworst case ratio

Mathematics Subject Classification ID

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

Cites Work

• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Scheduling a single batch processing machine with non-identical job sizes

This page was built for publication: Approximation schemes for scheduling a batching machine with nonidentical job size