RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., Ser. 2, 2003, Volume 10, Number 2, Pages 29–55 (Mi da148)  

This article is cited in 7 scientific papers (total in 7 papers)

The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem

Yu. A. Kochetov, A. A. Stolyar

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (311 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.85
Received: 17.09.2003
Revised: 10.10.2003

Citation: Yu. A. Kochetov, A. A. Stolyar, “The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003), 29–55

Citation in format AMSBIB
\Bibitem{KocSto03}
\by Yu.~A.~Kochetov, A.~A.~Stolyar
\paper The use of alternating neighborhoods for an approximate solution of a resource-constrained scheduling problem
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2003
\vol 10
\issue 2
\pages 29--55
\mathnet{http://mi.mathnet.ru/da148}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2058009}
\zmath{https://zbmath.org/?q=an:1042.90022}


Linking options:
  • http://mi.mathnet.ru/eng/da148
  • http://mi.mathnet.ru/eng/da/v10/s2/i2/p29

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Yu. A. Kochetov, A. A. Stolyar, “Novye zhadnye evristiki dlya zadachi kalendarnogo planirovaniya s ogranichennymi resursami”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 12:1 (2005), 12–36  mathnet  mathscinet  zmath
    2. Krasovskii D.V., Furugyan M.G., “Algorithms for Solving Minimax Scheduling Problem”, Journal of Computer and Systems Sciences International, 47:5 (2008), 732–736  crossref  mathscinet  zmath  isi  scopus
    3. Felinskas G., Sakalauskas L., “Variable neighborhood Simulated Annealing method and application for design”, 25th International Symposium on Automation and Robotics in Construction - Isarc-2008, 2008, 566–572  crossref  isi
    4. Faraonov A.V., “Razrabotka algoritma prinyatiya operativnykh reshenii pri vybore novogo marshruta dostavki”, Menedzhment v Rossii i za rubezhom, 2012, no. 3, 84–90  elib
    5. E. N. Goncharov, “Stokhasticheskii zhadnyi algoritm dlya zadachi kalendarnogo planirovaniya s ogranichennymi resursami”, Diskretn. analiz i issled. oper., 21:3 (2014), 11–24  mathnet  mathscinet
    6. Furugyan M.G., “Some Algorithms of Solving Minimax Multiprocessor Scheduling Problem”, J. Comput. Syst. Sci. Int., 53:2 (2014), 195–200  crossref  mathscinet  zmath  isi  elib  scopus
    7. E. N. Goncharov, V. V. Leonov, “Genetic algorithm for the resource-constrained project scheduling problem”, Autom. Remote Control, 78:6 (2017), 1101–1114  mathnet  crossref  mathscinet  isi  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:467
    Full text:146
    References:50

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020