Charles A Micchelli
Journal of Approximation Theory
Paper
A polynomial algorithm for a one machine batching problem
Abstract
A problem of batching identical jobs on a single machine is studied. Constant processing times and batch setup times are assumed. An algorithm is presented to minimize the sum over all jobs of the batched completion times, and shown to run in time polynomial in the logarithms of the problem parameters. © 1992.
Related
Conference paper
Convergence properties of multi-dimensional stack filters
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990