Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
From MaRDI portal
Publication:4632969
DOI10.1002/nav.21740zbMath1411.90152OpenAlexW2617500550MaRDI QIDQ4632969
Vitaly A. Strusevich, Gur Mosheiov
Publication date: 2 May 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21740
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Flows in graphs (05C21)
Related Items (4)
A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ Flowshop scheduling with learning effect and job rejection ⋮ A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection ⋮ Single machine lot scheduling with optional job-rejection
This page was built for publication: Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
