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., 2012, Volume 19, Number 3, Pages 65–78 (Mi da691)  

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

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.

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

English version:
Journal of Applied and Industrial Mathematics, 2012, 6:3, 346–354

Bibliographic databases:

UDC: 519.8
Received: 08.08.2011
Revised: 22.11.2011

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://www.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:
  • http://mi.mathnet.ru/eng/da691
  • http://mi.mathnet.ru/eng/da/v19/i3/p65

    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
  • Дискретный анализ и исследование операций
    Number of views:
    This page:370
    Full text:82
    References:29
    First page:7

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