|
Computer science
Metric approach for finding approximate solutions of scheduling problems
A. A. Lazarev, D. V. Lemtyuzhnikova, N. A. Pravdivets Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, 117997, Moscow, Russia
Abstract:
Metric functions are introduced for various classes of single-machine scheduling problems. It is shown how approximate solutions of NP-hard problems can be found using these functions. The metric value is determined by solving a linear programming problem with constraints being systems of linear inequalities for polynomial or pseudopolynomial solvable instances of the problem under study. In fact, the initial instance is projected onto the subspace of solvable problem instances in the introduced metric.
Key words:
scheduling theory, metric, approximation, optimization methods.
Received: 26.11.2020 Revised: 26.11.2020 Accepted: 11.03.2021
Citation:
A. A. Lazarev, D. V. Lemtyuzhnikova, N. A. Pravdivets, “Metric approach for finding approximate solutions of scheduling problems”, Zh. Vychisl. Mat. Mat. Fiz., 61:7 (2021), 1179–1191; Comput. Math. Math. Phys., 61:7 (2021), 1169–1180
Linking options:
https://www.mathnet.ru/eng/zvmmf11268 https://www.mathnet.ru/eng/zvmmf/v61/i7/p1179
|
|