TY - JOUR
T1 - Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
AU - Mosheiov, Gur
AU - Strusevich, Vitaly A.
N1 - Publisher Copyright:
© 2017 Wiley Periodicals, Inc.
PY - 2017/4
Y1 - 2017/4
N2 - In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min-cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution.
AB - In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min-cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution.
KW - batching
KW - quadratic min-cost flow
KW - rejection
KW - single machine scheduling
UR - http://www.scopus.com/inward/record.url?scp=85019710414&partnerID=8YFLogxK
U2 - 10.1002/nav.21740
DO - 10.1002/nav.21740
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85019710414
SN - 0894-069X
VL - 64
SP - 217
EP - 224
JO - Naval Research Logistics
JF - Naval Research Logistics
IS - 3
ER -