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 3, Pages 65–78 (Mi da691)  
This article is cited in 7 scientific papers (total in 7 papers)

Preemptive routing open shop on a link

A. V. Pyatkina, I. D. Chernykhab

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (322 kB) Citations (7)
References:
PDF
HTML
Abstract: Preemptive routing open shop problem is a generalization of two classic discrete optimization problems: NP-hard metric TSP and polynomially solvable open shop scheduling problem. We show that the problem with two machines is polynomially solvable while in case when the number of machines is a part of an input the problem is strongly NP-hard. Ill. 6, bibliogr. 6.
Keywords: routing open shop, preemption, NP-completeness.
Received: 08.08.2011
Revised: 22.11.2011
English version:
Journal of Applied and Industrial Mathematics, 2012, Volume 6, Issue 3, Pages 346–354
DOI: https://doi.org/10.1134/S199047891203009X
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: A. V. Pyatkin, I. D. Chernykh, “Preemptive routing open shop on a link”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 65–78; J. Appl. Industr. Math., 6:3 (2012), 346–354
Citation in format AMSBIB
\Bibitem{PyaChe12}
\by A.~V.~Pyatkin, I.~D.~Chernykh
\paper Preemptive routing open shop on a~link
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 3
\pages 65--78
\mathnet{http://mi.mathnet.ru/da691}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2986642}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 3
\pages 346--354
\crossref{https://doi.org/10.1134/S199047891203009X}
Linking options:
  • https://www.mathnet.ru/eng/da691
  • https://www.mathnet.ru/eng/da/v19/i3/p65
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:501
    Full-text PDF :126
    References:51
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024