Conference paper
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
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
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Yi Zhou, Parikshit Ram, et al.
ICLR 2023