A metric for total tardiness minimization |
| |
| Authors: | A A Lazarev A A Sologub |
| |
| Affiliation: | 1.Trapeznikov Institute of Control Sciences,Russian Academy of Sciences,Moscow,Russia;2.Lomonosov State University,Moscow,Russia;3.Moscow Institute of Physics and Technology,Moscow,Russia;4.Higher School of Economics (National Research University),Moscow,Russia |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
