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 - http://www.scopus.com/inward/record.url?scp=84864034114&partnerID=8YFLogxK
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 -