A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING

DOI10.1142/S0129054102001473zbMath1067.68178OpenAlexW2047403924MaRDI QIDQ3021988

Haodi Feng, Guo Jun Li, Xiaotie Deng, Gui Zhen Liu

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001473

zbMATH Keywords

dynamic programmingcompletion timebatch schedulingbatch machine

Mathematics Subject Classification ID

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

Related Items (3)

Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ Mixed batch scheduling on identical machines ⋮ Batch scheduling of nonidentical job sizes with minsum criteria

Cites Work

• Scheduling a batching machine
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

This page was built for publication: A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING