Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Kazanskii Gosudarstvennyi Universitet. Uchenye Zapiski. Seriya Fiziko-Matematichaskie Nauki, 2008, Volume 150, Book 4, Pages 154–161 (Mi uzku710)  
Pseudopolynomial Approximation Algorithm for Solving the $NP$-Complete Problem of Minimizing Maximum Lateness

O. N. Shulgina, N. K. Sherbakova

Chair of Economic Cybernetics of Kazan State University
Full-text PDF (228 kB)
References:
PDF
HTML
Abstract: The article states and proves pseudopolynomial complexity approximation algorithm for solving the scheduling theory known as $NP$-complete problem, namely minimizing maximum lateness on a single machine, interruption in job processing being banned. The bound value absolute error of criterion function for schedule constructed by algorithm is received.
Keywords: schedule, lateness, pseudopolynomial algorithm, $NP$-complete, complexity.
Received: 01.10.2008
UDC: 519.854
Language: Russian
Citation: O. N. Shulgina, N. K. Sherbakova, “Pseudopolynomial Approximation Algorithm for Solving the $NP$-Complete Problem of Minimizing Maximum Lateness”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 150, no. 4, Kazan University, Kazan, 2008, 154–161
Citation in format AMSBIB
\Bibitem{ShuShc08}
\by O.~N.~Shulgina, N.~K.~Sherbakova
\paper Pseudopolynomial Approximation Algorithm for Solving the $NP$-Complete Problem of Minimizing Maximum Lateness
\serial Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki
\yr 2008
\vol 150
\issue 4
\pages 154--161
\publ Kazan University
\publaddr Kazan
\mathnet{http://mi.mathnet.ru/uzku710}
Linking options:
  • https://www.mathnet.ru/eng/uzku710
  • https://www.mathnet.ru/eng/uzku/v150/i4/p154
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki
    Statistics & downloads:
    Abstract page:552
    Full-text PDF :220
    References:64
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025