John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and 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
Sankar Basu
Journal of the Franklin Institute
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences