M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
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
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998