Otto-von-Guericke-Universität Magdeburg



by E.R. Gafarov, A.A. Lazarev, F. Werner


Preprint series: 10-12, Preprints

90B35 Scheduling theory, See also {68M20}


Abstract; In this paper, 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.

Keywords: Scheduling, Single machine problems, Maximization problems, Total tardiness

The author(s) agree, that this abstract may be stored as full text and distributed as such by abstracting services.

Letzte Änderung: 10.02.2016 - Ansprechpartner: Pierre Krenzlin