Prikladnaya Diskretnaya Matematika
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


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2016, Number 3(33), Pages 67–77
DOI: https://doi.org/10.17223/20710410/33/5 (Mi pdm555) 		 
This article is cited in 4 scientific papers (total in 4 papers)

Applied Graph Theory

Chain structures in schedules tasks

A. M. Magomedov

Dagestan State University, Makhachkala, Russia
Full-text PDF (854 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.17223/20710410/33/5
Abstract: Some algorithms for constructing the following shedules are developed: 1) one-processor schedule with a partial precedence, 2) a multiprocessor schedule without idle time and conditions of partial precedence.
Keywords: schedule, graph, algorithm, colors, complexity.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 2588
Bibliographic databases:
Document Type: Article
UDC: 681.142.1+621.316
Language: Russian
Citation: A. M. Magomedov, “Chain structures in schedules tasks”, Prikl. Diskr. Mat., 2016, no. 3(33), 67–77
Citation in format AMSBIB
\Bibitem{Mag16}
\by A.~M.~Magomedov
\paper Chain structures in schedules tasks
\jour Prikl. Diskr. Mat.
\yr 2016
\issue 3(33)
\pages 67--77
\mathnet{http://mi.mathnet.ru/pdm555}
\crossref{https://doi.org/10.17223/20710410/33/5}
Linking options:
  • https://www.mathnet.ru/eng/pdm555
  • https://www.mathnet.ru/eng/pdm/y2016/i3/p67
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:180
    Full-text PDF :201
    References:31
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024