KFU. Card publication. About one algorithm for solving scheduling problem

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

ABOUT ONE ALGORITHM FOR SOLVING SCHEDULING PROBLEM

Form of presentation

Articles in international journals and collections

Year of publication

2015

Язык

английский

Authors, employees of KFU

Shulgina Oksana Nikolaevna, author

Bibliographic description in the original language

Shulgina O. N., Shcherbakova N. K. About one aigorithm for solving scheduling problem.-Lobachevskii Journal of Mathematics, 2015, Vol. 36, No. 2, pp. 212–215

Keywords

scheduling, lateness, pseudopolynomial algorithm, properties, NP-completeness, complexity

The name of the journal

Lobachevskii Journal of Mathematics

URL

http://www.scopus.com/inward/record.url?eid=2-s2.0-84934956925&partnerID=40&md5=904734cca6d6a68bdd0ba0c55b450c51

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=120657&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Shulgina Oksana Nikolaevna	ru_RU
dc.date.accessioned	2015-01-01T00:00:00Z	ru_RU
dc.date.available	2015-01-01T00:00:00Z	ru_RU
dc.date.issued	2015	ru_RU
dc.identifier.citation	Shulgina O. N., Shcherbakova N. K. About one aigorithm for solving scheduling problem.-Lobachevskii Journal of Mathematics, 2015, Vol. 36, No. 2, pp. 212–215	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=120657&p_lang=2	ru_RU
dc.description.abstract	Lobachevskii Journal of Mathematics	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	scheduling	ru_RU
dc.subject	lateness	ru_RU
dc.subject	pseudopolynomial algorithm	ru_RU
dc.subject	properties	ru_RU
dc.subject	NP-completeness	ru_RU
dc.subject	complexity	ru_RU
dc.title	About one algorithm for solving scheduling problem	ru_RU
dc.type	Articles in international journals and collections	ru_RU