Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
研究单机调度中相同作业分成有界批次的问题，允许拒绝部分作业并支付罚金，目标是最小化完工时间、交付成本和拒绝成本之和，通过转化为二次最小成本流问题求解。
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. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017