A theoretical development for the total tardiness problem and its application in branch and bound algorithms

DOI10.1016/j.cor.2012.06.005zbMath1349.90437OpenAlexW2006843697MaRDI QIDQ339575

Zhaohui Liu, Shuyu Zhou

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.005

zbMATH Keywords

schedulingbranch and boundsingle machinetotal tardiness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid algorithm for the single-machine total tardiness problem
• The single-machine total tardiness scheduling problem: review and extensions
• A heuristic for the single machine tardiness problem
• A greedy heuristic for the mean tardiness sequencing problem
• A decomposition algorithm for the single machine total tardiness problem
• A fully polynomial approximation scheme for the total tardiness problem
• Improving the complexities of approximation algorithms for optimization problems
• Augmentations of consistent partial orders for the one-machine total tardiness problem
• On decomposition of the total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Insights into two solution procedures for the single machine tardiness problem
• The Total Tardiness Problem: Review and Extensions
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Algorithmic paradoxes of the single-machine total tardiness problem

This page was built for publication: A theoretical development for the total tardiness problem and its application in branch and bound algorithms