We consider here the one-machine serial batching problem under weighted average completion. This problem is known to be NP-hard and to date no approximation algorithm exists. Batching has wide application in manufacturing, decision management, and scheduling in information technology. In this paper, we give the first approximation algorithm for the problem… (More)

@inproceedings{Bein2007ApproximationFB,
title={Approximation for Batching via Priorities1},
author={Wolfgang W. Bein and John Noga and Jeffrey WIEGLEY},
year={2007}
}