Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
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
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Yi Zhou, Parikshit Ram, et al.
ICLR 2023