| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524011 | Operations Research Letters | 2005 | 5 Pages |
Abstract
We address a classical minimum flow-time, single-machine, batch-scheduling problem. Processing times and setups are assumed to be identical for all jobs and batches, respectively. Santos and Magazine (Oper. Res. Lett. 4(1985) 99) introduced an efficient solution for the relaxed (non-integer) problem. We introduce a simple rounding procedure for Santos and Magazine's solution, which guarantees optimal integer batches.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gur Mosheiov, Daniel Oron, Yaacov Ritov,