Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings