| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142690 | Operations Research Letters | 2008 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tracy Kimbrel, Maxim Sviridenko,