George Markowsky
J. Math. Anal. Appl.
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
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences