On the single machine total tardiness problem

DOI10.1016/j.ejor.2004.03.017zbMath1062.90030MaRDI QIDQ1771373

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.03.017

zbMATH Keywords

Scheduling; Single machine; Total tardiness

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

A tabu search algorithm for the single machine total weighted tardiness problem, The single-machine total tardiness scheduling problem: review and extensions, Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Solution of the single machine total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Total Tardiness Problem: Review and Extensions
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Algorithmic paradoxes of the single-machine total tardiness problem