Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
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
Charles Micchelli
Journal of Approximation Theory
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990