Kazan Federal University Digital Repository

About one algorithm for solving scheduling problem

Show simple item record

dc.contributor.author Shulgina O.
dc.contributor.author Shcherbakova N.
dc.date.accessioned 2018-09-18T20:34:49Z
dc.date.available 2018-09-18T20:34:49Z
dc.date.issued 2015
dc.identifier.issn 1995-0802
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/141344
dc.description.abstract © 2015, Pleiades Publishing, Ltd. In this paper we proved the new properties optimal schedules for unknown strongly NP-complete scheduling problem of minimizing maximum lateness on a single machine, not allowing preemption. Pseudopolynomial implementation of the general scheme for solving that problem based on these properties is developed.
dc.relation.ispartofseries Lobachevskii Journal of Mathematics
dc.subject complexity
dc.subject lateness
dc.subject NP-completeness
dc.subject properties
dc.subject pseudopolynomial algorithm
dc.subject scheduling
dc.subject sequencing
dc.title About one algorithm for solving scheduling problem
dc.type Article
dc.relation.ispartofseries-issue 2
dc.relation.ispartofseries-volume 36
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 211
dc.source.id SCOPUS19950802-2015-36-2-SID84934956925


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics