Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow

Gur Mosheiov, Vitaly A. Strusevich*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

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.

Original languageAmerican English
Pages (from-to)217-224
Number of pages8
JournalNaval Research Logistics
Volume64
Issue number3
DOIs
StatePublished - Apr 2017

Bibliographical note

Publisher Copyright:
© 2017 Wiley Periodicals, Inc.

Keywords

  • batching
  • quadratic min-cost flow
  • rejection
  • single machine scheduling

Fingerprint

Dive into the research topics of 'Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow'. Together they form a unique fingerprint.

Cite this