New Precedence Theorems for One-Machine Weighted Tardiness

DOI10.1287/moor.1070.0255zbMath1341.90047OpenAlexW2019537266MaRDI QIDQ5388048

John J. Kanet

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1070.0255

zbMATH Keywords

single-machine schedulingweighted tardinessprecedence

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Distributionally robust single machine scheduling with the total tardiness criterion ⋮ A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance ⋮ Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity ⋮ The proportionate flow shop total tardiness problem ⋮ New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives ⋮ Precedence theorems and dynamic programming for the single-machine weighted tardiness problem ⋮ Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ Minimizing delays in a shunting yard ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness ⋮ One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons

This page was built for publication: New Precedence Theorems for One-Machine Weighted Tardiness