Otto-von-Guericke-Universität Magdeburg



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


Preprint series: 10-10, Preprints

90B35 Scheduling theory, See also {68M20}


Abstract; In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. An NP-hardness proof and a pseudo-polynomial time solution algorithm are proposed for a special case of this problem.

Keywords: Scheduling, Single machine, Total tardiness, Number of tardy jobs, Complexity, Pseudo-polynomial algorithm

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