Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
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
Imran Nasim, Michael E. Henderson
Mathematics
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence