Minimizing flow-time on a single machine with integer batch sizes

Gur Mosheiov; Daniel Oron; Yaacov Ritov

doi:10.1016/j.orl.2004.09.007

Minimizing flow-time on a single machine with integer batch sizes

Gur Mosheiov^*, Daniel Oron, Yaacov Ritov

^*Corresponding author for this work

Business Administration

Research output: Contribution to journal › Article › peer-review

34 Scopus citations

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	https://doi.org/10.1016/j.orl.2004.09.007
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

Access to Document

10.1016/j.orl.2004.09.007

Cite this

@article{c12f6ef4fe584117a85e371aabf613c2,

title = "Minimizing flow-time on a single machine with integer batch sizes",

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 = "Deterministic batch scheduling, Flow-time, Single machine",

author = "Gur Mosheiov and Daniel Oron and Yaacov Ritov",

note = "Funding Information: This paper was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem, Israel.",

year = "2005",

month = sep,

doi = "10.1016/j.orl.2004.09.007",

language = "אנגלית",

volume = "33",

pages = "497--501",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Minimizing flow-time on a single machine with integer batch sizes

AU - Mosheiov, Gur

AU - Oron, Daniel

AU - Ritov, Yaacov

N1 - Funding Information: This paper was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem, Israel.

PY - 2005/9

Y1 - 2005/9

N2 - 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.

AB - 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.

KW - Deterministic batch scheduling

KW - Flow-time

KW - Single machine

UR - http://www.scopus.com/inward/record.url?scp=19944397854&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2004.09.007

DO - 10.1016/j.orl.2004.09.007

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:19944397854

SN - 0167-6377

VL - 33

SP - 497

EP - 501

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Minimizing flow-time on a single machine with integer batch sizes

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this