Fernando Martinez, Juntao Chen, et al.
AAAI 2025
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
Compression scheme for digital cinema application
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence