Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 2010, Issue 10, Pages 107–121 (Mi at898)  
This article is cited in 42 scientific papers (total in 42 papers)

Multi-Machine and Multi-Stage Scheduling Environments

Scheduling with multiple servers

F. Wernera, S. A. Kravchenkob

a Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik
b United Institute of Informatics Problems, Belarussian National Academy of Sciences, Minsk, Belarus
Full-text PDF (205 kB) Citations (42)
References:
PDF
HTML
Abstract: In this paper, we consider the problem of scheduling a set of jobs on a set of identical parallel machines. Before the processing of a job can start, a setup is required which has to be performed by a given set of servers. We consider the complexity of such problems for the minimization of the makespan. For the problem with equal processing times and equal setup times we give a polynomial algorithm. For the problem with unit setup times, $m$ machines and $m-1$ servers, we give a pseudopolynomial algorithm. However, the problem with fixed number of machines and servers in the case of minimizing maximum lateness is proven to be unary $NP$-hard. In addition, recent algorithms for some parallel machine scheduling problems with constant precessing times are generalized to the corresponding server problems for the case of constant setup times. Moreover, we perform a worst case analysis of two list scheduling algorithms for makespan minimization.
Presented by the member of Editorial Board: A. A. Lazarev

Received: 12.01.2010
English version:
Automation and Remote Control, 2010, Volume 71, Issue 10, Pages 2109–2121
DOI: https://doi.org/10.1134/S0005117910100103
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: F. Werner, S. A. Kravchenko, “Scheduling with multiple servers”, Avtomat. i Telemekh., 2010, no. 10, 107–121; Autom. Remote Control, 71:10 (2010), 2109–2121
Citation in format AMSBIB
\Bibitem{WerKra10}
\by F.~Werner, S.~A.~Kravchenko
\paper Scheduling with multiple servers
\jour Avtomat. i Telemekh.
\yr 2010
\issue 10
\pages 107--121
\mathnet{http://mi.mathnet.ru/at898}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2779037}
\zmath{https://zbmath.org/?q=an:1218.93058}
\transl
\jour Autom. Remote Control
\yr 2010
\vol 71
\issue 10
\pages 2109--2121
\crossref{https://doi.org/10.1134/S0005117910100103}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000283359800010}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77958503248}
Linking options:
  • https://www.mathnet.ru/eng/at898
  • https://www.mathnet.ru/eng/at/y2010/i10/p107
    • This publication is cited in the following 42 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:368
    Full-text PDF :62
    References:33
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024