Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomatika i Telemekhanika, 2004, Issue 3, Pages 108–115 (Mi at1546)  

Discrete Optimization

A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory

O. N. Shul'gina

Kazan State University
References:
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.
Presented by the member of Editorial Board: A. I. Kibzun

Received: 27.06.2003
English version:
Automation and Remote Control, 2004, Volume 65, Issue 3, Pages 456–463
DOI: https://doi.org/10.1023/B:AURC.0000019378.28352.14
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: O. N. Shul'gina, “A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory”, Avtomat. i Telemekh., 2004, no. 3, 108–115; Autom. Remote Control, 65:3 (2004), 456–463
Citation in format AMSBIB
\Bibitem{Shu04}
\by O.~N.~Shul'gina
\paper A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory
\jour Avtomat. i Telemekh.
\yr 2004
\issue 3
\pages 108--115
\mathnet{http://mi.mathnet.ru/at1546}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2100656}
\zmath{https://zbmath.org/?q=an:1074.90020}
\transl
\jour Autom. Remote Control
\yr 2004
\vol 65
\issue 3
\pages 456--463
\crossref{https://doi.org/10.1023/B:AURC.0000019378.28352.14}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000220615200014}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84904240891}
Linking options:
  • https://www.mathnet.ru/eng/at1546
  • https://www.mathnet.ru/eng/at/y2004/i3/p108
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:276
    Full-text PDF :110
    References:34
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024