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.
| Original language | English |
|---|---|
| Pages (from-to) | 497-501 |
| Number of pages | 5 |
| Journal | Operations Research Letters |
| Volume | 33 |
| Issue number | 5 |
| DOIs | |
| State | Published - Sep 2005 |
Bibliographical note
Funding Information:This paper was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem, Israel.
Keywords
- Deterministic batch scheduling
- Flow-time
- Single machine
Fingerprint
Dive into the research topics of 'Minimizing flow-time on a single machine with integer batch sizes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver