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

DOI10.1016/J.COR.2012.06.005MaRDI QIDQ339575zbMATH OpenOpenAlexFDO

Authors Shuyu Zhou, Zhaohui Liu

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

schedulingsingle machinetotal tardinessbranch and bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1076139
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Solution of the single machine total tardiness problem
• On the Single-machine Scheduling Problem with Tardiness Penalties
• Algorithmic paradoxes of the single-machine total tardiness problem

Cites work

• scientific article; zbMATH DE number 3821425 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 900396 (Why is no real title available?)
• A decomposition algorithm for the single machine total tardiness problem
• A fully polynomial approximation scheme for the total tardiness problem
• A greedy heuristic for the mean tardiness sequencing problem
• A heuristic for the single machine tardiness problem
• A hybrid algorithm for the single-machine total tardiness problem
• Algorithmic paradoxes of the single-machine total tardiness problem
• Augmentations of consistent partial orders for the one-machine total tardiness problem
• Improving the complexities of approximation algorithms for optimization problems
• Insights into two solution procedures for the single machine tardiness problem
• Introduction to algorithms
• Minimizing Total Tardiness on One Machine is NP-Hard
• On decomposition of the total tardiness problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• The Total Tardiness Problem: Review and Extensions
• The single-machine total tardiness scheduling problem: review and extensions

Cited in

(2)

• Algorithmic paradoxes of the single-machine total tardiness problem
• On the Single-machine Scheduling Problem with Tardiness Penalties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339575)