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, 2012, Volume 19, Issue 5, Pages 21–34 (Mi da702)  
Running time of local search algorithms for a scheduling problem on the parallel machines

Yu. Yu. Velikanova

Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (285 kB)
References:
PDF
HTML
Abstract: We study behavior of local search algorithms with quadratic neighborhoods for the NP-hard scheduling problem $P\|C_{\max}$. We obtain new upper and lower bounds for the running time of the local search algorithms with the given pivoting rule. Bibliogr. 11.
Keywords: local search algorithm, neighborhood, running time of the algorithm, upper and lower bounds.
Received: 13.08.2009
Revised: 14.03.2012
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: Yu. Yu. Velikanova, “Running time of local search algorithms for a scheduling problem on the parallel machines”, Diskretn. Anal. Issled. Oper., 19:5 (2012), 21–34
Citation in format AMSBIB
\Bibitem{Vel12}
\by Yu.~Yu.~Velikanova
\paper Running time of local search algorithms for a~scheduling problem on the parallel machines
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 5
\pages 21--34
\mathnet{http://mi.mathnet.ru/da702}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3058506}
Linking options:
  • https://www.mathnet.ru/eng/da702
  • https://www.mathnet.ru/eng/da/v19/i5/p21
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:319
    Full-text PDF :87
    References:36
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024