| Article ID: | iaor200699 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 5 |
| Start Page Number: | 497 |
| End Page Number: | 501 |
| Publication Date: | Sep 2005 |
| Journal: | Operations Research Letters |
| Authors: | Mosheiov Gur, Oron Daniel, Ritov Yaacov |
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 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.