학술논문
A metric for total tardiness minimization.
Document Type
Article
Author
Source
Subject
*TARDINESS
*POLYNOMIALS
*APPROXIMATION theory
*ERROR analysis in mathematics
*SCHEDULING
*MATHEMATICAL models
*
*
*
*
*
Language
ISSN
0005-1179
Abstract
In this paper we consider the NP-hard 1| r |Σ T scheduling problem, suggesting a polynomial algorithm to find its approximate solution with the guaranteed absolute error. The algorithm employs a metric introduced in the parameter space. In addition, we study the possible application of such an approach to other scheduling problems. [ABSTRACT FROM AUTHOR]