Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
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
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics