Processing math: 100%
Trudy Matematicheskogo Instituta imeni V.A. Steklova
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Trudy Mat. Inst. Steklova:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2015, Volume 290, Pages 178–190
DOI: https://doi.org/10.1134/S0371968515030152 (Mi tm3637) 		 
This article is cited in 1 scientific paper (total in 1 paper)

On the complexity of constructing multiprocessor little-preemptive schedules

E. V. Shchepin

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia
Full-text PDF (219 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.1134/S0371968515030152
Abstract: We present a full and correct proof of the fact that the problem of constructing an optimal schedule for the open shop problem with at most m−3 preemptions for an m‑processor system is NP-hard. We also show that the proof of this result given by E. Shchepin and N. Vakhania in Ann. Oper. Res. 159, 183–213 (2008) is incorrect.
Funding agency Grant number
Russian Science Foundation 14-50-00005
This work is supported by the Russian Science Foundation under grant 14-50-00005.
Received: March 15, 2015
English version:
Proceedings of the Steklov Institute of Mathematics, 2015, Volume 290, Issue 1, Pages 166–177
DOI: https://doi.org/10.1134/S0081543815060152
Bibliographic databases:
Document Type: Article
UDC: 519.854.1
Language: Russian
Citation: E. V. Shchepin, “On the complexity of constructing multiprocessor little-preemptive schedules”, Modern problems of mathematics, mechanics, and mathematical physics, Collected papers, Trudy Mat. Inst. Steklova, 290, MAIK Nauka/Interperiodica, Moscow, 2015, 178–190; Proc. Steklov Inst. Math., 290:1 (2015), 166–177
Citation in format AMSBIB
\Bibitem{Shc15}
\by E.~V.~Shchepin
\paper On the complexity of constructing multiprocessor little-preemptive schedules
\inbook Modern problems of mathematics, mechanics, and mathematical physics
\bookinfo Collected papers
\serial Trudy Mat. Inst. Steklova
\yr 2015
\vol 290
\pages 178--190
\publ MAIK Nauka/Interperiodica
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/tm3637}
\crossref{https://doi.org/10.1134/S0371968515030152}
\elib{https://elibrary.ru/item.asp?id=24045402}
\transl
\jour Proc. Steklov Inst. Math.
\yr 2015
\vol 290
\issue 1
\pages 166--177
\crossref{https://doi.org/10.1134/S0081543815060152}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000363268500015}
\elib{https://elibrary.ru/item.asp?id=24962694}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84944706114}
Linking options:
  • https://www.mathnet.ru/eng/tm3637
  • https://doi.org/10.1134/S0371968515030152
  • https://www.mathnet.ru/eng/tm/v290/p178
    • Related presentations:
    This publication is cited in the following 1 articles:
    1. Ahmadian M.M., Khatami M., Salehipour A., Cheng T.C.E., “Four Decades of Research on the Open-Shop Scheduling Problem to Minimize the Makespan”, Eur. J. Oper. Res., 295:2 (2021), 399–426  crossref  mathscinet  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Труды Математического института имени В. А. Стеклова Proceedings of the Steklov Institute of Mathematics
    Statistics & downloads:
    Abstract page:259
    Full-text PDF :56
    References:54
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025