dc.contributor.author |
Lazarev A. |
|
dc.contributor.author |
Sadykov R. |
|
dc.contributor.author |
Sevastyanov S. |
|
dc.date.accessioned |
2018-09-18T20:33:28Z |
|
dc.date.available |
2018-09-18T20:33:28Z |
|
dc.date.issued |
2007 |
|
dc.identifier.issn |
1990-4789 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/141121 |
|
dc.description.abstract |
The strongly NP-hard scheduling problem of minimizing the maximum lateness on one machine subject to job release dates is under study. We present a general scheme of approximation solution of the problem which is based on searching for a given problem instance another instance, closest to the original in some metric and belonging to a known polynomially solvable class of instances. For a few concrete variants of the scheme (using different polynomially solvable classes of instances) some analytic formulas are found that make it possible, given a problem instance, to compute easily an upper bound on the absolute error of the solution obtained by a chosen scheme. © Pleiades Publishing, Ltd. 2007. |
|
dc.relation.ispartofseries |
Journal of Applied and Industrial Mathematics |
|
dc.title |
A scheme of approximation solution of problem 1 rj Lmax |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
4 |
|
dc.relation.ispartofseries-volume |
1 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
468 |
|
dc.source.id |
SCOPUS19904789-2007-1-4-SID37249021861 |
|