Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
From MaRDI portal
Publication:2203602
DOI10.1016/j.ipl.2020.106009zbMath1466.90035MaRDI QIDQ2203602
Baruch Mor, Gur Mosheiov, Dana Shapira
Publication date: 7 October 2020
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2020.106009
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C39: Dynamic programming
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
A note on lot scheduling on a single machine to minimize maximum weighted tardiness, A note on the single machine CON and CONW problems with lot scheduling
Cites Work