On decomposition of the total tardiness problem

Authors:
S. Chang;Q. Lu;G. Tang;W. Yu
Affiliations:
Mathematics Department, Wuhan University, Wuhan, Hubei 430072, China;Management Department, Shanghai Second Polytechnic University, Shanghai 200002, China;Management Department, Shanghai Second Polytechnic University, Shanghai 200002, China;Applied Mathematics Institute, East China University of Science & Technology, Shanghai 200237, China
Venue:
Operations Research Letters
Year:
1995

Citing 2
Cited 7

Minimizing total tardiness on one machine is NP-hard

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

Operations Research Letters

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

Journal of Scheduling
A hybrid algorithm for the single-machine total tardiness problem

Computers and Operations Research
A branch, bound, and remember algorithm for the 1|ri|Σti scheduling problem

Journal of Scheduling
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem

Mathematical and Computer Modelling: An International Journal
Scheduling a single machine to minimize a regular objective function under setup constraints

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

Computers and Operations Research
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

As an improvement of the famous Lawler Decomposition Theorem for the one-machine total tardiness problem, some conditions on decomposition positions are obtained by Potts and Wassenhove, and are used by them to make the decomposition algorithm more efficient. In this paper, more conditions on the leftmost decomposition position are proved. Additional computational tests are described.