Single machine scheduling to minimize total weighted tardiness

DOI10.1016/j.ejor.2004.04.013zbMath1066.90025OpenAlexW1981858350MaRDI QIDQ1772846

Xianqiang Yang

Publication date: 21 April 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.013

zbMATH Keywords

TardinessDue datesSingle machine schedulingProcessing-plus-waitSLK due-dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Approximation algorithms for minimizing the total weighted tardiness on a single machine ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ Optimal restricted due date assignment in scheduling ⋮ A tabu search algorithm for the single machine total weighted tardiness problem ⋮ A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date ⋮ An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ Approximation algorithms for scheduling problems with a modified total weighted tardiness objective ⋮ Unnamed Item ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem ⋮ A population-based variable neighborhood search for the single machine total weighted tardiness problem ⋮ New results for scheduling to minimize tardiness on one machine with rejection and related problems ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines ⋮ Order assignment and scheduling under processing and distribution time uncertainty ⋮ Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey of scheduling research involving due date determination decisions
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
• Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
• Processing-plus-wait due dates in single-machine scheduling
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Single machine scheduling to minimize total weighted tardiness