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 80–89 (Mi at895)  
This article is cited in 4 scientific papers (total in 4 papers)

Scheduling Problems on a Single Machine

Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine

A. A. Lazarev, A. G. Kvaratskhelia

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (185 kB) Citations (4)
References:
PDF
HTML
Abstract: In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases.
Presented by the member of Editorial Board: P. Yu. Chebotarev

Received: 12.01.2010
English version:
Automation and Remote Control, 2010, Volume 71, Issue 10, Pages 2085–2092
DOI: https://doi.org/10.1134/S0005117910100073
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. A. Lazarev, A. G. Kvaratskhelia, “Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine”, Avtomat. i Telemekh., 2010, no. 10, 80–89; Autom. Remote Control, 71:10 (2010), 2085–2092
Citation in format AMSBIB
\Bibitem{LazKva10}
\by A.~A.~Lazarev, A.~G.~Kvaratskhelia
\paper Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a~single machine
\jour Avtomat. i Telemekh.
\yr 2010
\issue 10
\pages 80--89
\mathnet{http://mi.mathnet.ru/at895}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2779034}
\zmath{https://zbmath.org/?q=an:1203.93129}
\transl
\jour Autom. Remote Control
\yr 2010
\vol 71
\issue 10
\pages 2085--2092
\crossref{https://doi.org/10.1134/S0005117910100073}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000283359800007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77958497530}
Linking options:
  • https://www.mathnet.ru/eng/at895
  • https://www.mathnet.ru/eng/at/y2010/i10/p80
    • This publication is cited in the following 4 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:390
    Full-text PDF :99
    References:43
    First page:6
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024