Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
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
Charles Micchelli
Journal of Approximation Theory
Imran Nasim, Michael E. Henderson
Mathematics
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications