F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
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
Can hospitals afford digital storage for imagery?
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
James Lee Hafner
Journal of Number Theory
Conference paper
Neave effect also occurs with Tausworthe sequences
Shu Tezuka
WSC 1991