Leo Liberti, James Ostrowski
Journal of Global Optimization
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
Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis