Batch scheduling of identical jobs on parallel identical machines

Baruch Mor; Gur Mosheiov

doi:10.1016/j.ipl.2012.06.020

Batch scheduling of identical jobs on parallel identical machines

Baruch Mor, Gur Mosheiov^*

^*Corresponding author for this work

BA Business Department

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

8 Scopus citations

Abstract

We study the classical batch scheduling problem with identical job processing times and identical setups on parallel identical machines. We show that, similar to the single machine case, the solution is given by a closed form, consisting of identical decreasing arithmetic sequences of batch sizes on the different machines. A very close-to-optimal integer solution is obtained in O(m+n) time, where m is the number of machines, and n is the number of jobs.

Original language	English
Pages (from-to)	762-766
Number of pages	5
Journal	Information Processing Letters
Volume	112
Issue number	20
DOIs	https://doi.org/10.1016/j.ipl.2012.06.020
State	Published - 31 Oct 2012

Bibliographical note

Funding Information:
The second author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

Batch scheduling
Flowtime
Parallel identical machines
Scheduling
Setup times

Access to Document

10.1016/j.ipl.2012.06.020

Cite this

@article{b4d7a42bd933416bab325c11f35e2ce6,

title = "Batch scheduling of identical jobs on parallel identical machines",

abstract = "We study the classical batch scheduling problem with identical job processing times and identical setups on parallel identical machines. We show that, similar to the single machine case, the solution is given by a closed form, consisting of identical decreasing arithmetic sequences of batch sizes on the different machines. A very close-to-optimal integer solution is obtained in O(m+n) time, where m is the number of machines, and n is the number of jobs.",

keywords = "Batch scheduling, Flowtime, Parallel identical machines, Scheduling, Setup times",

author = "Baruch Mor and Gur Mosheiov",

note = "Funding Information: The second author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.",

year = "2012",

month = oct,

day = "31",

doi = "10.1016/j.ipl.2012.06.020",

language = "אנגלית",

volume = "112",

pages = "762--766",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "20",

}

TY - JOUR

T1 - Batch scheduling of identical jobs on parallel identical machines

AU - Mor, Baruch

AU - Mosheiov, Gur

N1 - Funding Information: The second author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

PY - 2012/10/31

Y1 - 2012/10/31

N2 - We study the classical batch scheduling problem with identical job processing times and identical setups on parallel identical machines. We show that, similar to the single machine case, the solution is given by a closed form, consisting of identical decreasing arithmetic sequences of batch sizes on the different machines. A very close-to-optimal integer solution is obtained in O(m+n) time, where m is the number of machines, and n is the number of jobs.

AB - We study the classical batch scheduling problem with identical job processing times and identical setups on parallel identical machines. We show that, similar to the single machine case, the solution is given by a closed form, consisting of identical decreasing arithmetic sequences of batch sizes on the different machines. A very close-to-optimal integer solution is obtained in O(m+n) time, where m is the number of machines, and n is the number of jobs.

KW - Batch scheduling

KW - Flowtime

KW - Parallel identical machines

KW - Scheduling

KW - Setup times

UR - https://www.scopus.com/pages/publications/84864034114

U2 - 10.1016/j.ipl.2012.06.020

DO - 10.1016/j.ipl.2012.06.020

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

AN - SCOPUS:84864034114

SN - 0020-0190

VL - 112

SP - 762

EP - 766

JO - Information Processing Letters

JF - Information Processing Letters

IS - 20

ER -

Batch scheduling of identical jobs on parallel identical machines

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this