Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Paper
High-multiplicity cyclic job shop scheduling
Abstract
We consider the High-Multiplicity Cyclic Job Shop Scheduling Problem. There are two objectives of interest: the cycle time and the flow time. We give several approximation algorithms after showing that a very restricted case is APX-hard. © 2008 Elsevier B.V. All rights reserved.
Related
Conference paper
Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Chai Wah Wu
Linear Algebra and Its Applications