A metric for total tardiness minimization

In this paper we consider the NP-hard 1| r j |Σ T j 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 a...

Full description

Saved in:
Bibliographic Details
Published inAutomation and remote control Vol. 78; no. 4; pp. 732 - 740
Main Authors Lazarev, A. A., Korenev, P. S., Sologub, A. A.
Format Journal Article
LanguageEnglish
Published Moscow Pleiades Publishing 01.04.2017
Springer Nature B.V
Subjects
CAE) and Design
Calculus of Variations and Optimal Control; Optimization
Computer-Aided Engineering (CAD
Control
Large Scale Systems Control
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Production scheduling
Robotics
Scheduling
Systems Theory
Online AccessGet full text

Cover

More Information
Summary:In this paper we consider the NP-hard 1| r j |Σ T j 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.
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117917040142