dc.contributor.author |
Shul'gina O. |
|
dc.date.accessioned |
2018-09-17T20:07:54Z |
|
dc.date.available |
2018-09-17T20:07:54Z |
|
dc.date.issued |
2004 |
|
dc.identifier.issn |
0005-1179 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/133073 |
|
dc.description.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. |
|
dc.relation.ispartofseries |
Automation and Remote Control |
|
dc.title |
A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
3 |
|
dc.relation.ispartofseries-volume |
65 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
456 |
|
dc.source.id |
SCOPUS00051179-2004-65-3-SID84904240891 |
|