Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one

We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial ru...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 196; no. 1; pp. 247 - 261
Main Authors Gafarov, Evgeny R., Lazarev, Alexander A., Werner, Frank
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.07.2012
Springer
Springer Nature B.V
Subjects
Algorithms
Business and Management
Combinatorics
Complexity
Costs
Energy consumption
Maximization
Operations research
Operations Research/Decision Theory
Optimization
Polynomials
Production scheduling
Running
Scheduling
Scheduling (Management)
Studies
Theory of Computation
Germany
Scheduling
Polynomial algorithm
Single machine problems
Maximization problems
Total tardiness
Online AccessGet full text

Cover

More Information
Summary:We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time. This result settles the complexity status of the problem under consideration which was open.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-011-1055-4