Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 1996, Volume 3, Issue 2, Pages 15–32 (Mi da433)  
This article is cited in 19 scientific papers (total in 19 papers)

Combinatorial complexity of scheduling jobs with simple linear growth of processing times

A. V. Kononov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (1728 kB) Citations (19)
Received: 12.03.1996
Bibliographic databases:
UDC: 519.8
Language: Russian
Citation: A. V. Kononov, “Combinatorial complexity of scheduling jobs with simple linear growth of processing times”, Diskretn. Anal. Issled. Oper., 3:2 (1996), 15–32
Citation in format AMSBIB
\Bibitem{Kon96}
\by A.~V.~Kononov
\paper Combinatorial complexity of scheduling jobs with simple linear growth of processing times
\jour Diskretn. Anal. Issled. Oper.
\yr 1996
\vol 3
\issue 2
\pages 15--32
\mathnet{http://mi.mathnet.ru/da433}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1402741}
\zmath{https://zbmath.org/?q=an:0859.90086}
Linking options:
  • https://www.mathnet.ru/eng/da433
  • https://www.mathnet.ru/eng/da/v3/i2/p15
    • This publication is cited in the following 19 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:384
    Full-text PDF :156
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024