Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

DOI10.1016/j.ipl.2020.106009zbMath1466.90035OpenAlexW3045331303MaRDI 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

zbMATH Keywords

schedulingdynamic programmingsingle machinelot schedulingnumber of tardy orders

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

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

• Unnamed Item
• Lot scheduling on a single machine
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• Reducibility among Combinatorial Problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Lot scheduling on a single machine to minimize the (weighted) number of tardy orders