|
Avtomatika i Telemekhanika, 2004, Issue 3, Pages 108–115
(Mi at1546)
|
|
|
|
Discrete Optimization
A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory
O. N. Shul'gina Kazan State University
Abstract:
The well-known strong NP-hard machine scheduling problem, i.e., minimization of the maximal tardiness, is investigated. New properties of the optimal schedule are derived and used to develop a new scheme for solving the above problem.
Citation:
O. N. Shul'gina, “A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory”, Avtomat. i Telemekh., 2004, no. 3, 108–115; Autom. Remote Control, 65:3 (2004), 456–463
Linking options:
https://www.mathnet.ru/eng/at1546 https://www.mathnet.ru/eng/at/y2004/i3/p108
|
Statistics & downloads: |
Abstract page: | 276 | Full-text PDF : | 110 | References: | 34 | First page: | 2 |
|