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

Authors:
Shuyu Zhou;Zhaohui Liu
Affiliations:
Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China and Rotterdam School of Management, Erasmus University, Post Box 1738, 3000 DR Rotterdam, the Net ...;Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China
Venue:
Computers and Operations Research
Year:
2013

Citing 9
Cited 0

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
A greedy heuristic for the mean tardiness sequencing problem

Computers and Operations Research
Augmentations of consistent partial orders for the one-machine total tardiness problem

Discrete Applied Mathematics
Introduction to algorithms

Introduction to algorithms
A hybrid algorithm for the single-machine total tardiness problem

Computers and Operations Research
Improving the complexities of approximation algorithms for optimization problems

Operations Research Letters
A fully polynomial approximation scheme for the total tardiness problem

Operations Research Letters
A decomposition algorithm for the single machine total tardiness problem

Operations Research Letters
On decomposition of the total tardiness problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with the single machine total tardiness problem, and proves that if the job sequences produced by two heuristics, named as Time Forward and Time Backward algorithms, have the same starting and ending job subsequences, then there exists an optimal job sequence with the starting and ending job subsequences. The computation experiments show that there is a significant improvement of the running time of a branch and bound algorithm with the incorporation of the new property.