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., 2013, Volume 20, Number 4, Pages 3–14 (Mi da735)  

This article is cited in 1 scientific paper (total in 1 paper)

The complexity of cyclic scheduling for identical jobs

E. A. Bobrovaa, A. A. Romanovabc, V. V. Servakhab

a Omsk Branch of Sobolev Institute Mathematics of SB RAS, 13 Pevtsov St., 644099 Omsk, Russia
b Dostoyevsky Omsk State University, 55a Mir Ave., 644077 Omsk, Russia
c Omsk Law Aсademy, 12 Korolenko St., 644010 Omsk, Russia

Abstract: We consider the Cyclic Job Shop Problem for identical jobs with the criterion for cycle time minimization when the number of simultaneously processed tasks during the cycle time is limited by a constant $H$. We prove that this problem is NP-hard in the case $H\ge4$. For the case $H=2$, we propose an exact polynomial algorithm. Ill. 7, bibliogr. 16.

Keywords: identical tasks, cyclic scheduling.

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

Bibliographic databases:
UDC: 519.854
Received: 21.11.2012
Revised: 03.04.2013

Citation: E. A. Bobrova, A. A. Romanova, V. V. Servakh, “The complexity of cyclic scheduling for identical jobs”, Diskretn. Anal. Issled. Oper., 20:4 (2013), 3–14

Citation in format AMSBIB
\Bibitem{BobRomSer13}
\by E.~A.~Bobrova, A.~A.~Romanova, V.~V.~Servakh
\paper The complexity of cyclic scheduling for identical jobs
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 4
\pages 3--14
\mathnet{http://mi.mathnet.ru/da735}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3114908}


Linking options:
  • http://mi.mathnet.ru/eng/da735
  • http://mi.mathnet.ru/eng/da/v20/i4/p3

    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

    This publication is cited in the following articles:
    1. E. A. Bobrova, V. V. Servakh, “Construction of cyclic schedules in presence of parallel machines”, J. Appl. Industr. Math., 11:1 (2017), 17–25  mathnet  crossref  crossref  mathscinet  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:206
    Full text:55
    References:28
    First page:4

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