Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow |
| |
| Authors: | Gur Mosheiov Vitaly A Strusevich |
| |
| Institution: | 1. School of Business Administration, The Hebrew University, Jerusalem, Israel;2. Department of Mathematical Sciences, University of Greenwich, Old Royal Naval College, London, United Kingdom |
| |
| 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. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017 |
| |
| Keywords: | single machine scheduling batching rejection quadratic min‐cost flow |
|
|
