R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
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
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences