Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
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
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Charles Micchelli
Journal of Approximation Theory