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, Ser. 2, 2000, Volume 7, Issue 1, Pages 9–34 (Mi da289)  
This article is cited in 16 scientific papers (total in 16 papers)

Polynomial solvability of scheduling problems with storable resources and directive deadlines

E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (2796 kB) Citations (16)
Received: 27.05.1999
Revised: 25.05.2000
Bibliographic databases:
UDC: 519.8
Language: Russian
Citation: E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov, “Polynomial solvability of scheduling problems with storable resources and directive deadlines”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:1 (2000), 9–34
Citation in format AMSBIB
\Bibitem{GimZalSev00}
\by E.~Kh.~Gimadi, V.~V.~Zalyubovskii, S.~V.~Sevast'yanov
\paper Polynomial solvability of scheduling problems with storable resources and directive deadlines
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2000
\vol 7
\issue 1
\pages 9--34
\mathnet{http://mi.mathnet.ru/da289}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1801876}
\zmath{https://zbmath.org/?q=an:1030.90024}
Linking options:
  • https://www.mathnet.ru/eng/da289
  • https://www.mathnet.ru/eng/da/v7/s2/i1/p9
    • This publication is cited in the following 16 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:855
    Full-text PDF :347
    References:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024