Y.Y. Li, K.S. Leung, et al.
J Combin Optim
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
Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems