Approximation for batching via priorities

MaRDI QIDQ3185841zbMATH OpenFDO

Authors J. Noga, John Wiegley, Wolfgang W. Bein

Publication date 5 August 2016

zbMATH Keywords

one-machine serial batching problempriorities

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)

Recommendations

• Scheduling with batching: Two job types
• Approximation algorithms in batch processing
• One-pass batching algorithms for the one-machine problem
• Approximation schemes for scheduling a batching machine with nonidentical job size
• scientific article; zbMATH DE number 1559487

This page was built for publication: Approximation for batching via priorities

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